Sciweavers

638 search results - page 5 / 128
» A New Approach to Tractable Planning
Sort
View
PAAMS
2010
Springer
14 years 7 days ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
AAAI
2012
11 years 10 months ago
A Multi-Path Compilation Approach to Contingent Planning
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
Ronen I. Brafman, Guy Shani
IROS
2006
IEEE
100views Robotics» more  IROS 2006»
14 years 1 months ago
Multi-Robot Motion Planning by Incremental Coordination
— A recent study showed that high failure rates in many instances of decoupled multi-robot motion planning makes the decoupled planning approach an unsuitable choice in compariso...
Mitul Saha, Pekka Isto
IOR
2006
126views more  IOR 2006»
13 years 7 months ago
A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
We consider the problem of radiation therapy treatment planning for cancer patients. During radiation therapy, beams of radiation pass through a patient, killing both cancerous an...
H. Edwin Romeijn, Ravindra K. Ahuja, James F. Demp...
FLAIRS
2008
13 years 9 months ago
Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
Lukás Chrpa, Roman Barták