Sciweavers

JAIR
2008
98views more  JAIR 2008»
13 years 5 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
JAIR
2008
107views more  JAIR 2008»
13 years 5 months ago
Exploiting Subgraph Structure in Multi-Robot Path Planning
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
Malcolm Ross Kinsella Ryan
IJRR
2008
75views more  IJRR 2008»
13 years 5 months ago
Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
Jur P. van den Berg, Mark H. Overmars
IJHR
2008
155views more  IJHR 2008»
13 years 5 months ago
The Challenge of Motion Planning for Soccer Playing Humanoid Robots
Motion planning for humanoids faces several challenging issues: high dimensionality of the configuration space, necessity to address balance constraints in single and double suppo...
Stefano Carpin, Marcelo Kallmann, Enrico Pagello
AUTOMATICA
2006
97views more  AUTOMATICA 2006»
13 years 5 months ago
Receding horizon control applied to optimal mine planning
In this paper we show that the problem of optimal mine planning can be cast in the framework of receding horizon control. Traditional formulations of this problem have cast it in ...
Graham C. Goodwin, María M. Seron, Richard ...
ASE
2006
122views more  ASE 2006»
13 years 5 months ago
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
Andrew Ireland, Jamie Stark
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
13 years 5 months ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins
AI
2010
Springer
13 years 5 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
AI
2008
Springer
13 years 5 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
ECAI
2010
Springer
13 years 5 months ago
Variable Level-Of-Detail Motion Planning in Environments with Poorly Predictable Bodies
Motion planning in dynamic environments consists of the generation of a collision-free trajectory from an initial to a goal state. When the environment contains uncertainty, preven...
Stefan Zickler, Manuela M. Veloso