108 search results - page 11 / 22 » Computational Complexity of Planning with Temporal Goals |
106
Voted
TVCG
2008
14 years 9 months ago
2008
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
ARGMAS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
SYNASC
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
IROS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— This paper provides proof-of-concept that stateof-the-art sampling-based motion planners that are tightly integrated with a physics-based simulator can compute paths th...