2017 IEEE Second Ecuador Technical Chapters Meeting (ETCM) · 2017 · 24 citations · 20 references
ComputingAutonomous SystemsRobotics EngineeringAerial RoboticsMotion PlanningPath PlanningCell DecompositionObstacle AvoidanceProbabilistic RoadmapsRapidly Exploring Random TreesRobot Motion PlanningTrajectory GenerationAdaptive Cell DecompositionAerial Obstacle AvoidanceApproximate Cell DecompositionExact Cell DecompositionMotion Planning With Rapidly Exploring Random TreesRapidly Exploring Random Tree VariantsSampling-based Motion Planning
One important challenge in the current research of UAVs is the obstacle avoidance feature, a highly demanded capability in all kinds of UAV applications. Different algorithms that perform sampling tasks in continuous or discrete spaces are widely used in path planning. The Probabilistic Roadmap (PRM) and Rapidly Exploring Random Tree (RRT) variants have a stochastic essence, which allows them to obtain a response even in wide and complex environments. However, they present disadvantages related to computational cost and time convergence of results. In this paper a survey on sampling-based planners is presented, comparing algorithms with continuous and discrete sampling in 3D environments. On the other hand, two new variants are introduced: the Exact Cell Decomposition on Probabilistic Roadmap (ECD-PRM), as an extension of PRM method, and the Modified Adaptive Cell Decomposition (MACD) performing a reduced space decomposition. The comparison is performed attending to several criteria such as path cost, number of generated nodes and number of control points in the final path, whenever it has been reached.
20
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Rapidly-exploring random trees : a new tool for path planning
Steven M. LaValle · 1998 · 3.6K citations
Distance transformations in digital images
Gunilla Borgefors · Computer Vision Graphics and Image Processing · 1986 · 1.9K citations