MINIMUM COST PATH SEARCH IN AN UNCERTAIN-CONFIGURATION SPACE

Eric Pierre, Romain Pepy

Abstract

The object of this paper is to propose a minimum cost path search algorithm in an uncertain-configuration space and to give its proofs of optimality and completeness. In order to achieve this goal, we focus on one of the simpler and efficient path search algorithm in the configuration space : the A* algorithm. We then add uncertainties and deal with them as if they were simple dof (degree of freedom). Next, we introduce towers of uncertainties in order to improve the efficiency of the search. Finally we prove the optimality and completeness of the resulting algorithm.

References

  1. Dijsktra, E. (1959). A note on two problems in connexion with graphs. In Numerische Mathematik, volume 1, pages 269-271.
  2. Fraichard, T. and Mermond, R. (May 1998). Path planning with uncertainty for car-like robots. In IEEE Int. Conf. on Robotic and Automation, pages 27-32.
  3. Hart, P., Nilsson, N., and Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. In IEEE Transaction on Systems Science and Cybernetics, SSC-4(2), pages 100-107.
  4. Lambert, A. and Gruyer, D. (September 14-19, 2003). Safe path planning in an uncertain-configuration space. In IEEE International Conference on Robotics and Automation, pages 4185-4190.
  5. Latombe, J. C. (1991). Robot Motion Planning. Kluwer Academic Publisher.
  6. Lazanas, A. and Latombe, J. C. (1995). Motion planning with uncertainty : a landmark approach. In Artificial Intelligence 76(1-2), pages 287-317.
  7. Nilsson, N. J. (1988). Principles of artificial intelligence. Morgan Kaufman Publisher inc.
  8. Pepy, R. and Lambert, A. (2006). Safe path planning in an uncertain-configuration space using rrt. In Proc. IEEE/RSJ International Conference on Intelligent Robots and Systems, pages 5376-5381, Beijing, China.
  9. Russel, S. J. and Norvig, P. (1995). Artificial Intelligence: A modern Approach, pages 92-101. Prentice Hall, Inc.
Download


Paper Citation


in Harvard Style

Pierre E. and Pepy R. (2007). MINIMUM COST PATH SEARCH IN AN UNCERTAIN-CONFIGURATION SPACE . In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO, ISBN 978-972-8865-83-2, pages 103-109. DOI: 10.5220/0001645301030109


in Bibtex Style

@conference{icinco07,
author={Eric Pierre and Romain Pepy},
title={MINIMUM COST PATH SEARCH IN AN UNCERTAIN-CONFIGURATION SPACE},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO,},
year={2007},
pages={103-109},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001645301030109},
isbn={978-972-8865-83-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO,
TI - MINIMUM COST PATH SEARCH IN AN UNCERTAIN-CONFIGURATION SPACE
SN - 978-972-8865-83-2
AU - Pierre E.
AU - Pepy R.
PY - 2007
SP - 103
EP - 109
DO - 10.5220/0001645301030109