Path planning using a lazy spatial network PRM

2009 17th Mediterranean Conference on Control and Automation, MED 2009

Volumn , Issue , 2009, Pages 940-945

  Gasparri, Andrea ^a   Oliva, Gabriele ^a   Panzieri, Stefano ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPARATIVE SIMULATION; INTENTIONAL ATTACKS; MOTION TASKS; NETWORK MODELS; NOVEL ALGORITHM; PLANNING PROBLEM; RANDOM FAULTS; RANDOM GENERATION; ROAD-MAPS; ROADMAP; SPATIAL NETWORK; SUITABLE SOLUTIONS; TOPOLOGICAL PROPERTIES;

ALGORITHMS; TOPOLOGY;

MOTION PLANNING;

EID: 84855986137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MED.2009.5164666     Document Type: Conference Paper

References (18)

1. J. Reif, "Complexity of the mover's problem and generalizations, " in 20th IEEE Symposium on Foundations of Computer Science, 1979, pp. 421-27.
2. J. Reif and Z. Sun, "On frictional mechanical systems and their computational power," SIAM Journal on Computing, vol. 32, no. 6, pp. 1449-1474, 2003.
3. L. Kavraki, P. Svetska, J. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," IEEE Transactions on Robotics and Automation, vol. 12, no. 4, pp. 566-580, 1996. (Pubitemid 126774162)
4. C. Nissoux, T. Siméon, J.-P. Laumond, and C. Nissoux, "Visibility-based probabilistic roadmaps," in 1999IEEE/RSJ International Conference on Intelligent Robots and Systems, 1999, pp. 1316-1321.
5. S. M. LaValle and J. J. Kuffner, "Rapidly-exploring random trees: Progress and prospects," in Algorithmic and Computational Robotics: New Directions, D. R. B. R. Donald, K. M. Lynch, Ed. MA: A K Peters, Wellesley, 2001, pp. 293-308.
6. R. Gayle, K. R. Klingler, and P. G. Xavier, "Lazy reconfiguration forest (lrt) - an approach for motion planning with multiple tasks in dynamic environments," in 2007 IEEE Int. Conf on Robotics and Automation, Roma, Italy, April 2007.
7. M. Kaiser and C. C. Hilgetag, "Spatial growth of real-world networks," PHYSICAL REVIEWE, vol. 69, no. 036103, pp. 1-5, March 2004.
8. R. Bohlin and L. Kavraki, "Path planning using lazy (prm)," in 2000 IEEE International Conference on Robotics and Automation, 2000, pp. 521-528.
9. X. F. Wang and G. Chen, "Complex networks: small-world, scale-free and beyond," Circuits and Systems Magazine, IEEE, vol. 3, no. 1, pp. 6-20, 2003.
10. B. M. Waxman, "Routing of multipoint connections," IEEE Journal on Selected Areas in Communication?, vol. 6, no. 9, pp. 1617-22, December 1988.
11. R. Cohen, K. Erez, D. ben Avraham, and S. Havlin, "Resilience of the internet to random breakdowns," PHYS.REV.LETT, vol. 85, p. 4626, 2000.
12. M. T. Gastner and M. E. J. Newman, "The spatial structure of networks," 2004.
13. P. Holme and B. J. Kim, "Attack vulnerability of complex networks," PHYSICAL REVIEWE, vol. 65, no. 056109, pp. 1-14, May 2002.
14. M. E. Newman, "Scientific collaboration networks, ii. shortest paths, weighted networks, and centrality," PHYSICAL REVIEW E, vol. 64, no. 1, pp. 016 132 1-7, June 2001.
15. U. Brandes, "A faster algorithm for betweenness centrality," Journal of Mathematical Sociology, vol. 25, no. 2, pp. 163-177, 2001.
16. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, "Defining and identifying communities in networks," PNAS, vol. 101, no. 9, pp. 2658-2663, March 2004.
17. I. Kamon, E. Rimon, and I. H. Rivlin, "Tangentbug: A range-sensor-based navigation algorithm," The International Journal of Robotics Research, vol. 17, no. 9, pp. 934-953, 1998.
18. K. G. I. Gipson and M. Greenspan, "Mpk: An open extensible motion planning kernel," Journal of Robotic Systems, vol. 18, no. 8, pp. 433-443, December 2001. (Pubitemid 32736715)