Sciweavers

84 search results - page 8 / 17
» Exploiting State Constraints in Heuristic State-Space Planni...
Sort
View
AIMSA
2004
Springer
14 years 27 days ago
Exploiting the Constrainedness in Constraint Satisfaction Problems
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
Miguel A. Salido, Federico Barber
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
14 years 1 months ago
Greedy but Safe Replanning under Kinodynamic Constraints
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
Kostas E. Bekris, Lydia E. Kavraki
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
14 years 1 months ago
Control-driven mapping and planning
— Layered hybrid controllers typically include a planner at the top level with reactive control at the lower levels. The planner considers the state of the robot in a global cont...
David Wooden, Matthew Powers, Douglas C. MacKenzie...
NIPS
1997
13 years 8 months ago
Generalized Prioritized Sweeping
Prioritized sweeping is a model-based reinforcement learning method that attempts to focus an agent’s limited computational resources to achieve a good estimate of the value of ...
David Andre, Nir Friedman, Ronald Parr
AIPS
1994
13 years 8 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald