A Framework for Planning with Incrementally Created Graphs in Attributed Problem Spaces
In this thesis, a framework for parallel planning agents is developed and applied to planning problems ranging from domain independent planning to planning for autonomous vehicle systems. This general-purpose framework combines both logic-based and cost-based planning approaches in order to allow for the creation of logic-constrained, cost optimal plans with respect to possibly dynamic environments, user objectives, and constraints while providing the ability to construct "anytime" plans in partitioned problem spaces.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Gross Motion and Domain 1ndependent Planning
A Framework for Planning with lncrementally Created Graphs
The Layered World Model and Planning gystem 67
lmplementation and Results
List of Acronyms and Definitions
Planning Experiments for OffRoad Driving
1n addition 1n order actions agents arc cost architecture behavior cell cell decomposition cell tree Chapter complex compute Conference on Robotics constructed contains cost function created Cspace cubes decomposition domain independent planning evaluation example expanded F1GURE goal node graph nodes graph search Graphplan grid hard constraints heuristic hierarchy iand implemented incremental graph istep ithe key attributes knowledge layer LAWMPS lntelligence mobile robot Mohile Motion Planning node relevant attributes node's spanning set number of nodes obstacles Ol Ol operation path representation performed Plan Simulator planner planning algorithm planning cycle planning graph planning space planning system polygon quadtree rand regions representation representationally represented ring Robotics and Automation rules S S S shown in Figure soft constraints specific technique tower configurations towers of Hanoi uninformed search Value Judgment visibility graph Voronoi diagram