Motion planning with discrete abstractions and physics-based game engines

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

To increase automation in game design, this paper proposes a sampling-based motion-planning approach that works in conjunction with physics-based game engines. The approach automatically computes a sequence of motions that enables a virtual agent to reach a desired destination while avoiding collisions. The use of physics-based engines as the underlying simulator results in physically-realistic motions that take into account the motion dynamics, friction, gravity, and other forces interacting with the virtual agent. To account for the increased complexity and achieve computational efficiency, the approach expands a motion tree from the initial state to the goal using discrete abstractions as a guide in a best-first search fashion. Parametrized motion controllers are combined with randomized sampling to enable the motion planner to expand the motion tree along different directions. Comparisons to related work show significant computational speedups. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Plaku, E. (2012). Motion planning with discrete abstractions and physics-based game engines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7660 LNCS, pp. 290–301). Springer Verlag. https://doi.org/10.1007/978-3-642-34710-8_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free