Path Planning for Orbital Motions

April 1998

Path Planning for Orbital Motions


Abstract:

Path planning algorithms determine a path from start to goal locations, generally minimizing a cost such as time, distance, fuel, or other parameters. Often, this cost is estimated by the straight-line distance between two points or configurations. However, for a free flying space robot, a straight line is not necessarily the least costly path, because discrete thrusters generate arc-shaped trajectories defined by the current orbit of the robot. So, a way to consider non-straight paths must be found. This research uses the geometries in Voronoi diagrams to determine and define the path to take for a free flying space robot called AERCam. The current work deals with a two-dimensional world, though the extension to three dimensions is planned. Object-free corridors through which AERCam may safely maneuver are also defined. This work will lead to methods for determining the optimal path.
@conference{Shillcutt-1998-14608,
author = {Kimberly Shillcutt},
title = {Path Planning for Orbital Motions},
booktitle = {Proceedings of 3rd ASCE Specialty Conference on Robotics for Challenging Environments},
year = {1998},
month = {April},
pages = {57 - 63},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.