Path planning is an important issue for space robotics. Finding safe and energy-efficient paths in the presence of obstacles and other constraints can be complex although important. High-level (large-scale) path planning for robotic vehicles was investigated in three-dimensional space with obstacles, accounting for: (1) energy costs proportional to path length; (2) turn costs where paths change trajectory abruptly; and (3) safety costs for the danger associated with traversing a particular path due to visibility or invisibility from a fixed set of observers. Paths optimal with respect to these cost factors are found. Autonomous or semi-autonomous vehicles were considered operating either in a space environment around satellites and space platforms, or aircraft, spacecraft, or smart missiles operating just above lunar and planetary surfaces. One class of applications concerns minimizing detection, as for example determining the best way to make complex modifications to a satellite without being observed by hostile sensors; another example is verifying there are no paths (holes) through a space defense system. Another class of applications concerns maximizing detection, as finding a good trajectory between mountain ranges of a planet while staying reasonably close to the surface, or finding paths for a flight between two locations that maximize the average number of triangulation points available at any time along the path.
Vehicle Path-Planning in Three Dimensions Using Optics Analogs for Optimizing Visibility and Energy Cost
1989
10 pages
Report
No indication
English
Path Planning in Three Dimensions
Wiley | 2010
|Path Planning Algorithm of Intelligent Vehicle Based on Improved Visibility Graphs
SAE Technical Papers | 2018
|Path Planning Algorithm of Intelligent Vehicle Based on Improved Visibility Graphs
British Library Conference Proceedings | 2018
|