Fast replanning for navigation in unknown terrain

10.1137/0204032

10.1007/BFb0024016

frigioni, 1996, fully dynamic output bounded single source shortest path problem, Proc Symp Discrete Algorithms, 212

10.1016/S0304-3975(99)00132-2

10.1016/0304-3975(93)90328-Q

10.1109/JCIT.1990.128312

lin, 1990, on the dynamic shortest path problem, J Inform Process, 13, 470

10.1007/3-540-57155-8_269

10.1016/0020-0190(88)90136-6

10.1002/net.3230080406

hebert, 1999, experiments with driving modes for urban robots, Proc SPIE Mobile Robots, 140, 10.1117/12.369249

10.1007/PL00009224

10.1016/S0921-8890(02)00241-5

thayer, 2000, distributed robotic mapping of extreme environments, Proc SPIE Mobile Robots XV and Telemanipulator and Telepresence Technologies VII, 4195, 84, 10.1117/12.417292

brumitt, 1998, grammps: a generalized mission planner for multiple mobile robots, Proc Int Conf Robot Autom, 1564, 10.1109/ROBOT.1998.677360

10.1109/IRDS.2002.1041468

likhachev, 2002, speeding up the parti-game algorithm, Advances in Neural Information Processing Systems 15

10.1007/BF00993591

koenig, 2002, incremental <formula><tex>${\rm a}^{\ast}$ </tex></formula>, Advances in Neural Information Processing Systems 14

10.1006/jagm.1996.0046

10.1006/jagm.1999.1048

10.1016/0196-6774(91)90036-X

10.1109/ROBOT.1994.351061

10.1016/0304-3975(95)00079-8

10.1109/ROBOT.1995.525510

10.1016/0004-3702(90)90054-4

10.1145/322234.322235

stentz, 1995, the focussed <formula><tex>${\rm d}^{\ast}$ </tex></formula> algorithm for real-time replanning, Proc Int Joint Conf Artificial Intell, 1652

koenig, 2001, greedy mapping of terrain, Proc Int Conf Robot Autom, 3594

pearl, 1985, Heuristics Intelligent Search Strategies for Computer Problem Solving

10.1109/ROBOT.1994.351103

10.1007/BF00735431

10.1007/BF01840369

10.1016/S0921-8890(00)00118-4

10.1016/j.artint.2003.12.001

10.1142/S0218001490000174

koenig, 2002, improved fast replanning for robot navigation in unknown terrain, Proc Int Conf Robot Autom, 968

koenig, 2001, Improved fast replanning for robot navigation in unknown terrain

demeterscu, 2001, fully dynamic all pairs shortest paths with real edge weights, Proc Symp Foundations of Computer Science, 260, 10.1109/SFCS.2001.959900

10.1007/978-1-4615-4022-9

10.1109/SFFCS.1999.814580

stentz, 1996, map-based strategies for robot navigation in unknown environments, Proc AAAI Spring Symp Planning With Incomplete Information for Robot Problems, 110

frigioni, 1998, experimental analysis of dynamic algorithms for the single source shortest path problem, ACM J Experimental Algorithmics, 3, 10.1145/297096.297147

tao, 1997, optimal route re-planning for mobile robots: a massively parallel incremental <formula><tex>${\rm a}^{\ast}$</tex></formula> algorithm, IEEE Int Conf Robot Autom, 2727

10.1109/70.370502

ersson, 2001, path planning and navigation of mobile robots in unknown environments, Proc Int Conf Intell Robot Syst, 858