Continuous Path Planning with Multiple Constraints

Proceedings of the IEEE Conference on Decision and Control

Volumn 5, Issue , 2003, Pages 5502-5507

  Mitchell, Ian M ^a   Sastry, Shankar ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; FEEDBACK CONTROL; MATHEMATICAL MODELS; PARETO PRINCIPLE; PARTIAL DIFFERENTIAL EQUATIONS; ROBOTICS; WIRELESS TELECOMMUNICATION SYSTEMS;

COST METRICS; PARETO OPTIMAL SURFACES;

MOTION PLANNING;

EID: 1542379790     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2003.1272513     Document Type: Conference Paper

References (19)

1. J. N. Tsitsiklis, "Efficient algorithms for globally optimal trajectories," IEEE Transactions on Automatic Control, vol. AC-40, no. 9, pp. 1528-1538, 1995.
2. J. A. Sethian, "A fast marching level set method for monotonically advancing fronts," Proceedings of the National Academy of Sciences, USA, vol. 93, no. 4, pp. 1591-1595, 1996.
3. D. Adalsteinsson and J. A. Sethian, "The fast construction of extension velocities in level set methods," Journal of Computational Physics, vol. 148, pp. 2-22, 1999.
4. J.-C. Latombe, Robot Motion Planning. Boston: Kluwer Academic Publishers, 1991.
5. O. Khatib, "Real-time obstacle avoidance for manipulators and mobile robots," International Journal of Robotics Research, vol. 5, no. 1, pp. 90-98, 1986.
6. J. Barraquand, B. Langlois, and J. Latombe, "Numerical potential field techniques for robot path planning," IEEE Transactions on Systems, Man and Cybernetics, vol. 22, no. 2, pp. 224-241, 1992.
7. R. Kimmel and J. A. Sethian, "Optimal algorithm for shape from shading and path planning," Journal of Mathematical Imaging and Vision, vol. 14, no. 3, pp. 237-244, 2001.
8. K. Konolige, "A gradient method for realtime robot control," in International Conference on Intelligent Robots and Systems (IROS), vol. 1, (Takamatsu, Japan), pp. 639-646, 2000.
9. A. Orda, "Routing with end-to-end QoS guarantees in broadband networks," IEEE/ACM Transactions on Networking, vol. 7, pp. 365-374, June 1999.
10. G. Liu and K. G. Ramakrishnan, "A*prune: An algorithm for finding k shortest paths subject to multiple constraints," in INFOCOM 2001, vol. 2, pp. 743-749, 2001.
11. A. Puri and S. Tripakis, "Algorithms for routing with multiple constraints," in AIPS 2002 Workshop on Planning and Scheduling using Multiple Criteria, (Toulouse, France), pp. 7-14, April 2002.
12. th Society of Exploration Geophysicists Annual Meeting, (Houston, TX), pp. 1258-1261, 1995.
13. M. G. Crandall, L. C. Evans, and P.-L. Lions, "Some properties of viscosity solutions of Hamilton-Jacobi equations," Transactions of the American Mathematical Society, vol. 282, no. 2, pp. 487-502, 1984.
14. I. Mitchell and S. Sastry, "Continuous path planning with multiple constraints," Tech. Rep. UCB/ERL M03/34, Department of Electrical Engineering and Computer Science, University of California, Berkeley, August 2003.
15. E. W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik 1, pp. 269-271, 1959.
16. M. Falcone, "Numerical solution of dynamic programming equations," in Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman equations, Birkhäuser, 1997. Appendix A of [19].
17. H.-K. Zhao, "Fast sweeping method for Eikonal equations I: Distance function," tech. rep., UCI, Department of Mathematics, University of California, Irvine, CA, 92697-3875, 2002. Under review, SINUM.
18. J. A. Sethian, Level Set Methods and Fast Marching Methods. New York: Cambridge University Press, 1999.
19. M. Bardi and I. Capuzzo-Dolcetta, Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman equations. Boston: Birkhäuser, 1997.