Quasi-random algorithms for real-time spacecraft motion planning and coordination

Acta Astronautica

Volumn 53, Issue 4-10, 2003, Pages 485-495

  Frazzoli, Emilio ^a,b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FUNCTIONS; GRAPH THEORY; LINEAR PROGRAMMING; MANEUVERABILITY; MATHEMATICAL INSTRUMENTS; PROBABILITY; PROBLEM SOLVING; REAL TIME SYSTEMS; SPACECRAFT;

COST FUNCTIONS; HALTON SEQUENCES; OBSTACLE-FREE STEERING; SPACECRAFT TRAJECTORIES;

MOTION PLANNING;

EID: 3042584310     PISSN: 00945765     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0094-5765(03)80009-7     Document Type: Article

References (32)

1. A. B. Roger and C. R. McInnes Safety constrained freeflyer path planning at the International space station. AIAA J. on Guidance, Control an Dynamics, 23(6), 2000.
2. C. A. Beichman, N. J. Woolf, and C. A. Lindensmith. The terrestrial planet finder (TPF): A NASA Origins program to search for habitable planet. Technical Report 99-003, Jet Propulsion Laboratory, 1999.
3. A. Das and R. Cobb. TechSat 21: Space missions using collaborating constellations of satellites. AIAA paper 98-5265, 1998.
4. J.-C. Latombe. Motion planning: a journey of robots, molecules, digital actors, and other artifacts. International Journal of Robotics Research, 18(11):1119-1128, November 1999.
5. J.-C. Latombe. Robot Motion Planning. Kluwer, 1991.
6. Z Li and J.P. Canny, editors. Nonholonomic Motion Planning. Kluwer Academic Publishers, Boston, MA, 1993.
7. J.-P. Laumond, editor. Robot Motion Planning and Control, volume 229 of Lectures Notes in Control and Information Sciences. Springer, 1998. Available at http://www.laas.fr/̃jpl/book.html at the time of writing.
8. J.H. Reif. Complexity of the mover's problem and generalizations. In FOCS, pages 421-427, 1979.
9. P. Sedgewick. Algorithms. Addison Wesley, 2nd edition, 1988.
10. C. R. McInnes. Potential functions methods for autonomous spacecrft guidance and control. American Astronautical Society paper 95-447, 1995.
11. O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotics Research, 5(1):90-98, 1986.
12. Y.K. Hwang and N. Ahuja. A potential field approach to path planning. IEEE Transactions of Robotics and Automation, 8(1):23-32, February 1992.
13. J. Barraquand, B Langlois, and J.C. Latombe. Numerical potential field techniques for robot path planning. IEEE Transactions on Systems, Man and Cybernetics, 22(2):224-241, 1992.
14. E. Rimon and D.E. Koditscheck. Exact robot navigation using artificial potential fields IEEE Transaction on Robotics and Automation, 8(5):501-518, 1992.
15. T. Schouwenaars, B. De Moor, E. Feron, and J. How. Mixed integer programming for multi-vehicle path planning. In European Control Conference, Porto, Portugal, 2001.
16. A. Richards, T. Schouwenaare, J. P. How, and E. Feron. Spacecraft trajectory planning with avoidance constraints using mixed-integer linear programming. AIAA J. on Guidance, Control an Dynamics, 25(4), 2002.
17. C. A. Floudas. Nonlinear and Mixed-Integer Programming - fundamentals and Applications. Oxford University Press, New York, NY 1995.
18. L. E. Kavraki, M. N Kolountzakis, and J.C. Latombe. Analysis of probabilistic roadmaps for path planning- In Proceedings of the 1996 IEEE International Conference on Robotics and Automation, pages 3020-3025, 1996.
19. M. H. Overmars and P. Svestka. A paradigm for probabilistic path planning Technical report, Department of Computer Science, Utrecht University, March 1996.
20. L. E. Kavraki, P. Svestka, J.C. Latombe, and M.H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4):560-580, 1996
21. L. E. Kavraki, J.C. Latombe, R. Motwani, and P. Raghavan. Randomized query processing in robot path planning. Journal of Computer and System Sciences, 57(1):50-60, August 1998.
22. D. Hsu, L.E. Kavraki, J.C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners In Proceedings of the 1998 Workshop on AI-gorithmic Foundations of Robotics, Houston, TX, Much 1998.
23. D. Hsu, J.-C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. Int. J. Comp. Geometry and Applications, 9(4-5):495-512, 1999.
24. D. Hsu, J.-C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. In Proceeding of the 1997 IEEK International Conference on Robotics and Automation, 1997.
25. S. M. LaValle. Rapidly-exploring random trees: A new tool for path planning. Technical Report 98-11, Iowa State University, Ames, IA, Oct. 1998.
26. S.M. LaValle and J.J Kuffner. Randomized kinodynamic planning. In Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999.
27. J.J. Kuffner and S.M. LaValle. RRT-Counect: an efficient approach to single-query path planning. In IEEE International Conference on Robotic and Automation, 2000.
28. D. Hsu, J.C. Kindel, J.-C. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. In Proc. Workshop on Algorithmic Foundations of Robotics (WAFR'00), Hanover, NH, March 2000.
29. E. Frazzoli, M A. Dahleh, and E. Feron. Real-time motion planning for agile autonomous vehicles. AIAA J. on Guidance, Control an Dynamics, 25(1):116-129, 2002.
30. E. Frazzoli, M.A. Dahleh, E. Feron, and R.P. Kornfeld. A randomized attitude slew planning algorithm for autonomous spacecraft. In AIAA Conf, on Guidance, Navigation and Control, 2001.
31. S. M. LaValle and M. S. Branicky. On the relationship between classical grid search and probabilistic roadmaps. In Workshop on the Algorithmic Foundations of Robotia, 2002. To appear.
32. J. H. Halton. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numerical Mathematics, 2:84-90, 1960.