A continuous-state version of discrete randomized shortest-paths, with application to path planning

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2011, Pages 6570-6577

  García Díez, Silvia ^a   Vandenbussche, Eric ^a   Saerens, Marco ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; DIRECTED GRAPHS; GRAPH ALGORITHMS; PARTIAL DIFFERENTIAL EQUATIONS; PROBABILITY DISTRIBUTIONS;

DIFFUSION EQUATIONS; FEYNMAN-KAC FORMULA; FORWARD-AND-BACKWARD; INVERSE TEMPERATURES; PATH INTEGRAL SOLUTION; QUANTITIES OF INTERESTS; RANDOMIZED POLICIES; WEIGHTED DIRECTED GRAPH;

EQUATIONS OF STATE;

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

References (29)

1. T. Akamatsu. Cyclic flows, Markov process and stochastic traffic assignment. Transportation Research B, 30(5):369-386, 1996.
2. G. Arfken and H. Weber. Mathematical methods for physics. Elsevier, 2005.
3. H. Berg. Random walks in biology. Princeton University Press, 1993.
4. M. Chaichian and A. Demichev. Path integrals in physics, vol 1: stochastic processes and quantum mechanics. Institute of Physics Publishing, 2001.
5. C. Connolly, J. Burns, and R. Weiss. Path planning using Laplace's equation. In Proceedings of the IEEE International Conference on Robotics and Automation, volume 3, pages 2102-2106, 1990.
6. K. Dautenhahn and H. Cruse. Computer simulations of path generation and path form modification with local rules working on a parallel cell-based architecture. Computers & Mathematics with Applications, 28(5):75 - 88, 1994.
7. P. Del Moral. Feynman-Kac formulae: genealogical and interacting particle systems with applications. Springer, 2004.
8. S. García-Díez, F. Fouss, M. Shimbo, and M. Saerens. A sum-over-paths extension of edit distances accounting for all sequence alignments. Pattern Recognition, 44(6):1172 - 1182, 2011.
9. C. W. Gardiner. Handbook of stochastic methods. Springer, 2002.
10. M. Holmes. Introduction to the foundations of applied mathematics. Springer, 2002.
11. Y. Hwang and N. Ahuja. A potential field approach to path planning. IEEE Transactions on Robotics and Automation, 8(1):23-32, 1992.
12. K. Jacobs. Stochastic processes for physicists: understanding noisy systems. Cambridge University Press, 2010.
13. E. T. Jaynes. Information theory and statistical mechanics. Physical Review, 106(4):620-630, 1957.
14. J. G. Kemeny and J. L. Snell. Finite Markov chains, 2nd printing. Springer-Verlag, 1976.
15. O. Khatib. Real-time obstacle avoidance for manipulators and mobile robots. International Journal of Robotics Research, 5(1):90-98, 1986.
16. S. M. LaValle. Planning algorithms. Cambridge University Press, 2006.
17. Z. X. Li and T. D. Bui. Robot path planning using fluid model. Journal of Intelligent and Robotics Systems, 21(1):29-50, 1998.
18. C. Louste and A. Liegeois. Near optimal robust path planning for mobile robots: the viscous fluid method with friction. Journal of Intelligent and Robotics Systems, 27(1-2):99-112, 2000.
19. A. Mantrach, L. Yen, J. Callut, K. Francoisse, M. Shimbo, and M. Saerens. The sum-over-paths covariance kernel: A novel covariance measure between nodes of a directed graph. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(6):1112-1126, 2010.
20. R. M. Mazo. Brownian motion: fluctuations, dynamics, and applications. Oxford University Press, 2002.
21. N. G. Rambidi and D. Yakovenchuck. Finding paths in a labyrinth based on reaction-diffusion media. Biosystems, 51(2):67 - 72, 1999.
22. J. Rudnick and G. Gaspari. Elements of the random walk. Cambridge University Press, 2004.
23. M. Saerens, Y. Achbany, F. Fouss, and L. Yen. Randomized shortest-path problems: Two related models. Neural Computation, 21(8):2363-2404, 2009.
24. G. Schmidt and K. Azarm. Mobile robot navigation in a dynamic world using an unsteady diffusion equation strategy. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, pages 642-647, 1992.
25. G. Schmidt and W. Neubauer. High-speed robot path planning in time-varying environment employing a diffusion equation strategy. In S. G. Tzafestas, editor, Robotic systems: advanced techniques and applications, pages 207-215. Kluwer Academic Publishers, 1992.
26. L. Steels. Exploiting analogical representations. Robotics and Autonomous Systems, 6(1-2):71-88, June 1990.
27. L. Tarassenko and A. Blake. Analogue computation of collision-free paths. In Proceedings of the IEEE International Conference on Robotics and Automation, pages 540-545, 1991.
28. H. M. Taylor and S. Karlin. An introduction to stochastic modeling, 3th Ed. Academic Press, 1998.
29. L. Yen, A. Mantrach, M. Shimbo, and M. Saerens. A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In Proceedings of the 14th SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2008), pages 785-793, 2008.