Sciweavers

547 search results - page 9 / 110
» A Planning Algorithm not based on Directional Search
Sort
View
AI
1999
Springer
13 years 7 months ago
Using Grice's maxim of Quantity to select the content of plan descriptions
Intelligent systems are often called upon to form plans that direct their own or other agents' activities. For these systems, the ability to describe plans to people in natur...
R. Michael Young
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
14 years 2 months ago
Anytime, Dynamic Planning in High-dimensional Search Spaces
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
Dave Ferguson, Anthony Stentz
VTC
2007
IEEE
111views Communications» more  VTC 2007»
14 years 2 months ago
Analysis of a Spline Based, Obstacle Avoiding Path Planning Algorithm
—The Overbot is one of the original DARPA Grand Challenge vehicles now being used as a platform for autonomous vehicle research. The vehicle, equipped with a complete actuator an...
John Connors, Gabriel Elkaim
AAAI
2008
13 years 10 months ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang
AIPS
2004
13 years 9 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal