Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 1850678, 14 pages
https://doi.org/10.1155/2017/1850678
Research Article

Escaping Depressions in LRTS Based on Incremental Refinement of Encoded Quad-Trees

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

Correspondence should be addressed to Quanjun Yin; moc.361@nujnauq_niy

Received 31 July 2016; Revised 9 February 2017; Accepted 28 February 2017; Published 19 March 2017

Academic Editor: Chunlin Chen

Copyright © 2017 Yue Hu 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. P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE Transactions on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968. View at Publisher · View at Google Scholar · View at Scopus
  2. R. E. Korf, “Real-time heuristic search,” Artificial Intelligence, vol. 42, no. 2-3, pp. 189–211, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. M. Shimbo and T. Ishida, “Controlling the learning process of real-time heuristic search,” Artificial Intelligence, vol. 146, no. 1, pp. 1–41, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. D. Furcy and S. Koenig, “Speeding up the convergence of real-time search,” in Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, pp. 891–897, Austin, Tex, USA, August 2000.
  5. L. Y. Shue and R. Zamani, “An admissible heuristic search algorithm,” in Proceedings of the International Symposium on Methodologies for Intelligent Systems (ISMIS '93), pp. 69–75, Trondheim, Norway, June 1993.
  6. V. Bulitko, “Learning for adaptive real-time search,” Tech. Rep., Computer Science Research Repository (CoRR), 2004. View at Google Scholar
  7. S. Russell and E. Wefald, Do the Right Thing: Studies in Limited Rationality, MIT Press Series in Artificial Intelligence, MIT Press, Cambridge, Mass, USA, 1991. View at MathSciNet
  8. T. Ishida, “Moving target search with intelligence,” in Proceedings of the National Conference on Artificial Intelligence, pp. 525–532, San Jose, Calif, USA, July 1992.
  9. V. Bulitko and G. Lee, “Learning in real-time search: a unifying framework,” Journal of Artificial Intelligence Research, vol. 25, pp. 119–157, 2006. View at Google Scholar · View at Scopus
  10. S. Koenig and X. Sun, “Comparing real-time and incremental heuristic search for real-time situated agents,” Autonomous Agents and Multi-Agent Systems, vol. 18, no. 3, pp. 313–341, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. S. Koenig and M. Likhachev, “A new principle for incremental heuristic search: theoretical results,” in Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS '06), pp. 402–405, Cumbria, UK, June 2006.
  12. C. Hernańdez and P. Meseguer, “Improving LRTA∗(k),” in Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI '07), pp. 2312–2317, Hyderabad, India, January 2007. View at Scopus
  13. V. Bulitko, M. Luštrek, J. Schaeffer, Y. Björnsson, and S. Sigmundarson, “Dynamic control in real-time heuristic search,” Journal of Artificial Intelligence Research, vol. 32, pp. 419–452, 2008. View at Google Scholar · View at MathSciNet · View at Scopus
  14. V. Bulitko, Y. Björnsson, and R. Lawrence, “Case-based subgoaling in real-time heuristic search for video game pathfinding,” Journal of Artificial Intelligence Research, vol. 39, pp. 269–300, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. C. Hernández and J. A. Baier, “Fast subgoaling for pathfinding via real-time search,” in Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS '11), pp. 327–330, Freiburg, Germany, June 2011. View at Scopus
  16. 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 · View at Scopus
  17. N. Sturtevant and M. Buro, “Partial pathfinding using map abstraction and refinement,” in Proceedings of the National Conference on Artificial Intelligence, pp. 1392–1397, 1992.
  18. R. C. Holte, M. B. Perez, R. M. Zimmer, and A. J. MacDonald, “Hierarchical A*: searching abstraction hierarchies efficiently,” in Proceedings of the 1996 13th National Conference on Artificial Intelligence (AAAI '96), pp. 530–535, Portland, Oregon, August 1996. View at Scopus
  19. R. C. Holte, T. Mkadmi, R. M. Zimmer, and A. J. MacDonald, “Speeding up problem solving by abstraction: a graph oriented approach,” Artificial Intelligence, vol. 85, no. 1-2, pp. 321–361, 1996. View at Publisher · View at Google Scholar · View at Scopus
  20. V. Bulitko, N. Sturtevant, J. Lu, and T. Yau, “Graph abstraction in real-time heuristic search,” Journal of Artificial Intelligence Research, vol. 30, pp. 51–100, 2007. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  21. V. Bulitko, N. Sturtevant, and M. Kazakevich, “Speeding up learning in real-time search via automatic state abstraction,” in Proceedings of the 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference (AAAI '05/IAAI '05), pp. 1349–1354, Pittsburgh, Pa, USA, July 2005. View at Scopus
  22. C. Hernndez and P. Meseguer, “LRTA*(k),” in Proceedings of the International Joint Conference on Artificial Intelligence, July 2005.
  23. N. R. Sturtevant, V. Bulitko, and Y. Björnsson, “On learning in agent-centered search,” in Proceedings of the 9th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS '10), pp. 333–340, Toronto, Canada, May 2010. View at Scopus
  24. N. R. Sturtevant and V. Bulitko, “Learning where you are going and from whence you came: h- and g-cost learning in real-time heuristic search,” in Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI '11), pp. 365–370, Barcelona, Spain, July 2011. View at Publisher · View at Google Scholar · View at Scopus
  25. C. Hernandez and J. A. Baier, “Avoiding and escaping depressions in real-time heuristic search,” Journal of Artificial Intelligence Research, vol. 43, pp. 523–570, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. Y. Quanjun, Q. Long, P. Yong, and D. Wei, “Learning in real-time search on C-space GVDs,” Frontiers of Computer Science, In press.
  27. N. Sturtevant and R. Jansen, “An analysis of map-based abstraction and refinement,” in Proceedings of the International Symposium on Abstraction, Reformulation, and Approximation (SARA '07), pp. 344–358, Whistler, Canada, July 2007.
  28. 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
  29. R. Lawrence and V. Bulitko, “Database-driven real-time heuristic search in video-game pathfinding,” IEEE Transactions on Computational Intelligence and AI in Games, vol. 5, no. 3, pp. 227–241, 2013. View at Publisher · View at Google Scholar · View at Scopus
  30. Q. Yin, L. Qin, X. Liu, and Y. Zha, “Incremental construction of generalized Voronoi diagrams on pointerless quadtrees,” Mathematical Problems in Engineering, vol. 2014, Article ID 456739, 14 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. Y. Li, M. Q.-H. Meng, S. Li et al., “A quadtree based neural network approach to real-time path planning,” in Proceedings of the IEEE International Conference on Robotics and Biomimetics (ROBIO '07), pp. 1350–1354, IEEE, Sanya, China, December 2007. View at Publisher · View at Google Scholar · View at Scopus
  32. N. R. Sturtevant, “Choosing a search space representation,” in Game AI Pro: Collected Wisdom of Game AI Professionals, pp. 253–258, CRC Press, 2013. View at Google Scholar