D. Hsu, R. Kindel, J. Latombe, and S. Rock, "Randomized kinodynamic motion planning with moving obstacles," Int. Journal of Robotics Research, vol. 21, no. 3, pp. 233--255, March 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Generalizing the Analysis of PRM - Ladd, Kavraki (2002) (3 citations) (Correct)
.... Since 1994, when PRM was invented, several researchers have reported on the excellent performance of the planner for robots with many degrees of freedom, several variations of the method have been developed (e.g. 2] several planners that have been influenced by PRM have been introduced (e.g. [13, 19]) and several extensions of the basic path planning problem have been solved with PRM based methods (e.g. 23] The experimental success of the planner has motivated many researchers to seek a theoretical basis for explaining its performance and relative successes in this direction have been ....
.... of the basic path planning problem have been solved with PRM based methods (e.g. 23] The experimental success of the planner has motivated many researchers to seek a theoretical basis for explaining its performance and relative successes in this direction have been reported, among others, in [5, 6, 16, 15, 28, 13, 26]. This paper presents a further extension in this direction by using the mechanism of measure theory [4] Typically, there are two related questions that one asks about PRM operation. How quickly can we find a path between some x and y How quickly can we find most of the paths we are interested ....
[Article contains additional citation context not shown here]
D. Hsu, R. Kindel, J. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. In International Workshop on Algorithmic Foundations of Robotics (WAFR), 2000.
Generalizing the Analysis of PRM - Ladd, Kavraki (2002) (3 citations) (Correct)
.... Since 1994, when PRM was invented, several researchers have reported on the excellent performance of the planner for robots with many degrees of freedom, several variations of the method have been developed (e.g. 2] several planners that bare resemblances with PRM have been introduced (e.g. [10]) and sev eral extensions of the basic path planning problem have been solved with PRM based methods (e.g. 18] The experimental success of the planner has motivated many researchers to seek a theoretical basis for explaining its performance and relative successes in this direction have been ....
.... of the basic path planning problem have been solved with PRM based methods (e.g. 18] The experimental success of the planner has motivated many researchers to seek a theoretical basis for explaining its performance and relative successes in this direction have been reported, among others, in [5, 13, 12, 23, 10, 21]. This paper presents a further extension in this direction by using the mechanism of measure theory [4] 1.1 Previous Work The techniques discussed in this section can be roughly classified as one of two types: isolation of a single path and space covering arguments. This paper is interested ....
[Article contains additional citation context not shown here]
D. Hsu, R. Kindel, J. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. In International Workshop on Algorithmic Foundations of Robotics (WAFR), 2000.
Planning Paths for Elastic Objects Under Manipulation.. - Lamiraux, Kavraki (2001) (4 citations) (Correct)
....selected configurations, and collision free path segments. Once the initial and the final configuration are connected to this network, a path can be found by graph search. Several variations of PRM exist (see for example [3, 30, 18, 10, 52, 37, 11, 62, 14] Other interesting planners include [1, 2, 26, 32, 38, 31]. Although there exists efficient planners that take non holonomic and kinodynamic constraints into account (for example [39, 31] there are few cases where physical constraints and planning have been tightly coupled (one example is [20] As far as deformable robots and parts are concerned, ....
....can be found by graph search. Several variations of PRM exist (see for example [3, 30, 18, 10, 52, 37, 11, 62, 14] Other interesting planners include [1, 2, 26, 32, 38, 31] Although there exists efficient planners that take non holonomic and kinodynamic constraints into account (for example [39, 31]) there are few cases where physical constraints and planning have been tightly coupled (one example is [20] As far as deformable robots and parts are concerned, work has been done primarily in the context of manipulation. Robots with flexible links are now being built since they facilitate ....
D. Hsu, R. Kindel, J. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. In International Workshop on Algorithmic Foundations oy Robotics (WAFR), 2000.
Dynamic Robot Networks: A Coordination Platform for Multi-Robot.. - Clark (2004) Self-citation (Rock) (Correct)
No context found.
D. Hsu, R. Kindel, J. C. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. International Journal of Robotics Research, 21(3):233---255, March 2002.
Randomized Motion Planning for Groups of Nonholonomic Robots - Christopher Clark Stephen (2001) (1 citation) Self-citation (Rock) (Correct)
No context found.
D. Hsu, R. Kindel, J. C. Latombe, and S. Rock. "Randomized Kinodynamic Motion Planning with Moving Obstacles," in Workshop on the Algorithmic Foundations of Robotics, 2000.
Motion Planning for Multiple Mobile Robot Systems using.. - Clark, Rock, Latombe Self-citation (Latombe Rock) (Correct)
....3. MOTION PLANNING ALGORITHM 3. 1 Kinodynamic Randomized Motion Planning Probabilistic Road Maps (PRMs) are constructed by randomly selecting milestones from the robot s configuration space and connecting all milestones whose connecting paths are collision free [12] As described in [17] [11] and [16] this algorithm can be modified to accommodate kinodynamic constraints and accommodate moving obstacles by building a roadmap that includes time in the configuration space. This is known as Kinodynamic Randomized Motion Planning, KRMP) Also shown in [11] is that under reasonable ....
....[12] As described in [17] 11] and [16] this algorithm can be modified to accommodate kinodynamic constraints and accommodate moving obstacles by building a roadmap that includes time in the configuration space. This is known as Kinodynamic Randomized Motion Planning, KRMP) Also shown in [11], is that under reasonable assumptions on the free space, the probability of not finding a plan when one exists decreases exponentially to 0 as the number of sampled milestones increases. The work demonstrated how randomized motion planners can successfully build kinodynamically consistent ....
D. Hsu, R. Kindel, J. C. Latombe, & S. Rock, "Randomized Kinodynamic Motion Planning with Moving Obstacles," Workshop on the Algorithmic Foundations of Robotics, 2000.
Dynamic Networks for Motion Planning in Multi-Robot Space.. - Clark, Rock, Latombe (2003) Self-citation (Latombe Rock) (Correct)
No context found.
D. Hsu, R. Kindel, J.C. Latombe, & S. Rock. Randomized Kinodynamic Motion Planning with Moving Obstacles, Int. J. of Robotics Research, 21(3):233-255, March 2002.
Randomized Kinodynamic Motion Planning with Moving Obstacles - Hsu, Kindel, Latombe, Rock (2000) (22 citations) Self-citation (Hsu Kindel Latombe Rock) (Correct)
....6) we verified that the planner can reliably solve tricky problems. In the hardware robot testbed (Section 7) we verified that the planner can operate effectively despite various uncontrollable uncertainties and time delays. This paper combines and extends the results previously reported in [HKLR00, KHLR00] For more details, see [Hsu00, Kin01] 3 2 Previous Work 2.1 Motion planning by random sampling Sampling based motion planning is a classic concept in motion planning (e.g. see [Don87] Originally, the approach was proposed to both avoid difficulties encountered in implementing ....
D. Hsu, R. Kindel, J.C. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. In B.R. Donald et al., editors, Algorithmic and Computational Robotics: New Directions: The Fourth International Workshop on the Algorithmic Foundations of Robotics, pages 247--264. A. K. Peters, Wellesley, MA, 2000.
Randomised Rough-Terrain Robot Motion Planning - Ettlin, Bleuler (2006) (Correct)
No context found.
D. Hsu, R. Kindel, J. Latombe, and S. Rock, "Randomized kinodynamic motion planning with moving obstacles," Int. Journal of Robotics Research, vol. 21, no. 3, pp. 233--255, March 2002.
Coordinating Multiple Robots with Kinodynamic Constraints.. - Peng, Akella (2002) (4 citations) (Correct)
No context found.
D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. In B. R. Donald, K. M. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, pages 247--
Time-Scaled Coordination of Multiple Manipulators - Akella, Peng (2004) (Correct)
No context found.
D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock, "Randomized kinodynamic motion planning with moving obstacles," International Journal of Robotics Research, vol. 21, no. 3, pp. 233--255, Mar. 2002.
A Sampling-Based Motion Planning Approach to Maintain .. - Murrieta-Cid, Tovar, .. (Correct)
No context found.
D. Hsu, R. Kindel, J.C. Latombe and S. Rock. Randomized Kinodynamic Motion Planning with Moving Obstacles. In Workshop on Algorithm Foundations of Robotics, 2000.
A PRM-based Motion Planner for Dynamically - Changing Environments Lonard (Correct)
No context found.
D. Hsu, R. Kindel, J.C. Latombe, S. Rock. "Randomized Kinodynamic Motion Planning with Moving Obstacles". In Proc. of the Workshop on Algorithmic Foundations of Robotics (WAFR'00), 2000.
Safe Navigation of a Car-Like Robot within a Dynamic Environment - Petti, Fraichard (2005) (Correct)
No context found.
D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock, "Randomized kinodynamic motion planning with moving obstacles," Int. Journal of Robotics Research, vol. 21, no. 3, pp. 233--255, March 2002.
High-Speed Autonomous Navigation with Motion Prediction - Vasquez, Large, Laugier (2004) (Correct)
No context found.
D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock, "Randomized kinodynamic motion planning with moving obstacles," in Workshop on the Algorithmic Foundations of Robotics, 2000.
Partial Motion Planning Framework for Reactive Planning.. - Petti, Fraichard (2005) (Correct)
No context found.
Hsu, D., Kindel, R., Latombe, J.-C., and Rock, S. (2002). Randomized kinodynamic motion planning with moving obstacles. Int. Journal of Robotics Research, 21(3):233--255.
Moving Obstacles' Motion Prediction for Autonomous Navigation - Vasquez, Large, Laugier (2004) (Correct)
No context found.
D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock, "Randomized kinodynamic motion planning with moving obstacles, " in Workshop on the Algorithmic Foundations of Robotics, 2000.
Safe Motion Planning in Dynamic Environments - Petti, Fraichard (2005) (Correct)
No context found.
D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock, "Randomized kinodynamic motion planning with moving obstacles," Int. Journal of Robotics Research, vol. 21, no. 3, pp. 233--255, March 2002.
Toward Virtual Actors - Kalisiak (Correct)
No context found.
David Hsu, Robert Kindel, Jean-Claude Latombe, and Stephen Rock. Randomized kinodynamic motion planning with moving obstacles. The Fourth International Workshop on Algorithmic Foundations of Robotics, 2000.
Planning Algorithms - LaValle (2004) (3 citations) (Correct)
No context found.
D. Hsu, R. Kindel, J-C. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. In The Fourth International Workshop on Algorithmic Foundations of Robotics. 2000.
Roadmap-Based Flocking for Complex Environments - Burchan Bayazit Burchanb (2004) (1 citation) (Correct)
No context found.
D. Hsu, R. Kindel, J-C. Latombe, and S. Rock. Randomized Kinodynamic Motion Planning with Moving Obstacles. In Proc. Int. Workshop on Algorithmic Foundations of Robotics (WAFR), pages SA1--SA18, 2000.
Guided Expansive Spaces Trees: A Search Strategy for.. - Phillips, Bedrossian, .. (2004) (Correct)
No context found.
D. Hsu, R. Kindel, J.-C. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. International Workshop on Algorithmic Foudations of Robotics, pages 233--255, 2000.
Multiple Query Probabilistic Roadmap Planning - Using Single Query (2003) (Correct)
No context found.
D. Hsu, R. Kindel, J. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. IJRR, 2001.
Probabilistic Roadmaps of Trees for Parallel - Computation Of Multiple (2003) (Correct)
No context found.
D. Hsu, R. Kindel, J. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. IJRR, 2001.
Probabilistic Optimization Applied to Spacecraft.. - Phillips, Kavraki.. (2003) (Correct)
No context found.
Hsu, D., Kindel, R., Latombe, J.-C., and Rock, S. Randomized Kinodynamic Motion Planning with Moving Obstacles. International Workshop on Algorithmic Foudations of Robotics (2000).
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC