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 qanytimeq plans in partitioned problem spaces.F1GURE 4g: 1NTERNAL STRUCTURE OF THE LAWMPS 92 F1GURE 49: STRUCTURE OF COMPOSITE CELL-BASED COMPONENT OF KNOWLEDGE BASE. ... REG1ONS 112 F1GURE 65: 1NTERNAL STRUC7URE OF THE LAWMPS 116 F1GURE 66: UML USE CASE DIAGRAM ... ROADS 142 F1GURE 90: COST FUNCT1ON TO FOLLOW COMMAND ROUTE 143 FIGURE 91: PATH GENERATEDanbsp;...
|Title||:||A Framework for Planning with Incrementally Created Graphs in Attributed Problem Spaces|
|Author||:||Stephen B. Balakirsky|
|Publisher||:||IOS Press - 2003-01-01|