Sciweavers

241 search results - page 8 / 49
» Generalizing Plans to New Environments in Relational MDPs
Sort
View
COMPULOG
1999
Springer
14 years 26 days ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
PVLDB
2008
122views more  PVLDB 2008»
13 years 8 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
ICRA
2010
IEEE
106views Robotics» more  ICRA 2010»
13 years 7 months ago
Generalized direction changing fall control of humanoid robots among multiple objects
— Humanoid robots are expected to share human environments in the future and it is important to ensure safety of their operation. A serious threat to safety is the fall of a huma...
Umashankar Nagarajan, Ambarish Goswami
ATAL
2008
Springer
13 years 10 months ago
A new approach to cooperative pathfinding
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
M. Renee Jansen, Nathan R. Sturtevant
AIPS
2009
13 years 9 months ago
Optimality Properties of Planning Via Petri Net Unfolding: A Formal Analysis
We provide a theoretical analysis of planning via Petri net unfolding, a novel technique for synthesising parallel plans. Parallel plans are generally valued for their execution f...
Sarah L. Hickmott, Sebastian Sardiña