108 search results - page 7 / 22 » Computational Complexity of Planning with Temporal Goals |
TROB
2008
14 years 9 months ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— We propose a novel solution to the problem of inverse kinematics for redundant robotic manipulators for the purposes of goal selection for path planning. We unify the calculati...
144
click to vote
ICTL
1994
15 years 1 months ago
1994
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
109
click to vote
LOGCOM
1998
14 years 9 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...