Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 456739, 14 pages
http://dx.doi.org/10.1155/2014/456739
Research Article

Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees

College of Information System and Management, National University of Defense Technology, Changsha, Hunan 410073, China

Received 21 October 2013; Revised 5 January 2014; Accepted 6 January 2014; Published 26 February 2014

Academic Editor: Piermarco Cannarsa

Copyright © 2014 Quanjun Yin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. Daniel, A. Nash, S. Koenig, and A. Felner, “Theta*: any-angle path planning on grids,” Journal of Artificial Intelligence Research, vol. 39, pp. 533–579, 2010. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. Y. Lu, X. Huo, and P. Tsiotras, “Beamlet-like data processing for accelerated path-planning using multiscale information of the environment,” in Proceedings of the 49th IEEE Conference on Decision and Control (CDC '10), pp. 3808–3813, December 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. M. T. Rantanen and M. Juhola, “Using probabilistic roadmaps in changing environments,” Computer Animation and Virtual Worlds, 2013. View at Publisher · View at Google Scholar
  4. N. M. Wardhana, H. Johan, and H. S. Seah, “Enhanced waypoint graph for surface and volumetric path planning in virtual worlds,” The Visual Computer, vol. 29, no. 10, pp. 1051–1062, 2013. View at Publisher · View at Google Scholar
  5. N. Kalra, D. Ferguson, and A. Stentz, “Incremental reconstruction of generalized Voronoi diagrams on grids,” Robotics and Autonomous Systems, vol. 57, no. 2, pp. 123–128, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. J. O. Wallgrün, “Qualitative spatial reasoning for topological map learning,” Spatial Cognition and Computation, vol. 10, no. 4, pp. 207–246, 2010. View at Publisher · View at Google Scholar · View at Scopus
  7. B. Lau, C. Sprunk, and W. Burgard, “Improved updating of Euclidean distance maps and Voronoi diagrams,” in Proceedings of the 23rd IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '10), pp. 281–286, Taipei, Taiwan, October 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. N. Kalra, D. Ferguson, and A. Stentz, “Incremental reconstruction of generalized Voronoi diagrams on grids,” Robotics and Autonomous Systems, vol. 57, no. 2, pp. 123–128, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. B. Lau, C. Sprunk, and W. Burgard, “Efficient grid-based spatial representations for robot navigation in dynamic environments,” Robotics and Autonomous Systems, vol. 61, no. 10, pp. 1116–1130, 2013. View at Publisher · View at Google Scholar
  10. J. Vörös, “Low-cost implementation of distance maps for path planning using matrix quadtrees and octrees,” Robotics and Computer-Integrated Manufacturing, vol. 17, no. 6, pp. 447–459, 2001. View at Publisher · View at Google Scholar · View at Scopus
  11. F. Dehne, A. G. Ferreira, and A. Rau-chaplin, “Parallel processing of pointer based quadtrees on hypercube multiprocessors,” in Proceedings of the International Conference on Parallel Processing, 1991.
  12. M. G. Choi, E. Ju, J.-W. Chang, J. Lee, and Y. J. Kim, “Linkless octree using multi-level perfect hashing,” Computer Graphics Forum, vol. 28, no. 7, pp. 1773–1780, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. F. B. Atalay and D. M. Mount, “Pointerless implementation of hierarchical simplicial meshes and efficient neighbor finding in arbitrary dimensions,” International Journal of Computational Geometry & Applications, vol. 17, no. 6, pp. 595–631, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. X. Yin, I. Düntsch, and G. Gediga, Quadtree Representation and Compression of Spatial Data, Springer, Berlin, Germany, 2011.
  15. R. Fabbri, L. da F. Costa, J. C. Torelli, and O. M. Bruno, “2D Euclidean distance transform algorithms: a comparative survey,” ACM Computing Surveys, vol. 40, no. 1, article 2, 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. N. S. V. Rao, N. Stoltzfus, and S. S. Iyengar, “A “retraction” method for learned navigation in unknown terrains for a circular robot,” IEEE Transactions on Robotics and Automation, vol. 7, no. 5, pp. 699–707, 1991. View at Publisher · View at Google Scholar · View at Scopus
  17. H. Choset, S. Walker, K. Eiamsa-Ard, and J. Burdick, “Sensor-based exploration: incremental construction of the hierarchical generalized Voronoi graph,” The International Journal of Robotics Research, vol. 19, no. 2, pp. 126–148, 2000. View at Publisher · View at Google Scholar · View at Scopus
  18. C. M. Gold, P. R. Remmele, and T. Roos, “Voronoi methods in GIS,” in Algorithmic Foundations of Geographic Information Systems, vol. 1340, pp. 21–35, Springer, Berlin, Germany, 1997. View at Publisher · View at Google Scholar
  19. I. Lee and M. Gahegan, “Interactive analysis using Voronoi diagrams: algorithms to support dynamic update from a generic triangle-based data structure,” Transactions in GIS, vol. 6, no. 2, pp. 89–114, 2002. View at Publisher · View at Google Scholar · View at Scopus
  20. K. E. Hoff, T. Culver, J. Keyser, M. Lin, and D. Manocha, “Fast computation of generalized Voronoi diagrams using graphics hardware,” in Proceedings of the 26th annual conference on Computer graphics and interactive techniques (SIGGRAPH '99), 1999.
  21. L. Vachhani, A. D. Mahindrakar, and K. Sridharan, “Mobile robot navigation through a hardware-efficient implementation for control-law-based construction of generalized voronoi diagram,” IEEE/ASME Transactions on Mechatronics, vol. 16, no. 6, pp. 1083–1095, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. J. Barraquand and J. -C. Latombe, “Robot motion planning: a distributed representation approach,” Tech. Rep. STAN-CS-89-1257, Computer Science Department, Stanford University, 1989. View at Google Scholar
  23. S. Scherer, D. Ferguson, and S. Singh, “Efficient C-space and cost function updates in 3D for unmanned aerial vehicles,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA '09), pp. 2049–2054, Kobe, Japan, May 2009. View at Publisher · View at Google Scholar · View at Scopus
  24. T. Y. Zhang and C. Y. Suen, “A fast parallel algorithm for thinning digital patterns,” Communications of the ACM, vol. 27, no. 3, pp. 236–239, 1984. View at Publisher · View at Google Scholar · View at Scopus
  25. I. Boada, N. Coll, N. Madern, and J. A. Sellarès, “Approximations of 2D and 3D generalized Voronoi diagrams,” International Journal of Computer Mathematics, vol. 85, no. 7, pp. 1003–1022, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. Y. Lu, X. Huo, and P. Tsiotras, “Beamlet-like data processing for accelerated path-planning using multiscale information of the environment,” in Proceedings of the 49th IEEE Conference on Decision and Control (CDC '10), pp. 3808–3813, December 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. S. Ranade, A. Rosenfeld, and H. Samet, “Shape approximation using quadtrees,” Pattern Recognition, vol. 15, no. 1, pp. 31–40, 1982. View at Publisher · View at Google Scholar · View at Scopus
  28. H. Samet, “Data structures for quadtree approximation and compression,” Communications of the ACM, vol. 28, no. 9, pp. 973–993, 1985. View at Publisher · View at Google Scholar · View at Scopus
  29. I. Millington and J. D. Funge, Artificial Intelligence for Games, Taylor & Francis, New York, NY, USA, 2009.
  30. S. Koenig, M. Likhachev, and D. Furcy, “Lifelong planning A*,” Artificial Intelligence, vol. 155, no. 1-2, pp. 93–146, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  31. S. Koenig and M. Likhachev, “D* Lite,” in Proceedings of the AAAI Conference of Artificial Intelligence, pp. 476–483, August 2002. View at Scopus
  32. A. Botea, M. Müller, and J. Schaeffer, “Near optimal hierarchical path-finding,” Journal of Game Development, vol. 1, pp. 7–28, 2004. View at Google Scholar
  33. J. Hagelback, “Potential-field based navigation in StarCraft,” in Proceedings of the IEEE International Conference on Computational Intelligence and Games (CIG '12), 2012.