Sciweavers

1146 search results - page 52 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
VR
2007
IEEE
141views Virtual Reality» more  VR 2007»
14 years 2 months ago
Real-time Path Planning for Virtual Agents in Dynamic Environments
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
ICRA
2006
IEEE
93views Robotics» more  ICRA 2006»
14 years 1 months ago
Motion Planning for a Class of Planar Closed-chain Manipulators
— We study the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect)...
Guanfeng Liu, Jeffrey C. Trinkle, N. Shvalb
IPPS
2006
IEEE
14 years 1 months ago
Workforce planning with parallel algorithms
Workforce planning is an important activity that enables organizations to determine the workforce needed for continued success. A workforce planning problem is a very complex task...
Enrique Alba, Gabriel Luque, Francisco Luna
ICEIS
1999
IEEE
14 years 4 days ago
Facilitating Organisational Activities Using Plans and Audits
Group Decision Support Systems (GDSS) present important limitations that constrain their usage in current organisations. The fundamental reason is the lack of integration in the c...
Carlos J. Costa, Tania Ho, Pedro Antunes
CAEPIA
2007
Springer
13 years 12 months ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson