Transcription of D* Lite - idm-lab.org
{{id}} {{{paragraph}}}
Example: bachelor of science
D* Lite - idm-lab.org
, weapplyLifelongPlanningA*to robotnavigationinunknownterrain, *Litealgorithmis im-plementsthesamebehaviorasStentz FocussedDynamicA* prove propertiesaboutD* believe thattheseresultsprovidea ,suchasDynamicSWSF-FP(Ramalingam&Reps199 6), is givenin(Frigioni,Marchetti-Spaccamela,&N anni2000).Heuristicsearchmethods,suchasA *(Nilsson1971),ontheotherhand,useheurist icknowledgeinformofapproximationsofthego aldistancestofocusthesearchandsolve givenin(Pearl1985).We recentlyintroducedLPA*(LifelongPlan-ning A*),thatgeneralizesbothDynamicSWSF-FPand A*andthususestwo differenttechniquestoreduceitsplanningti me(Koenig&Likhachev 2001).Inthispaper, weapplyLPA* , theresultingplanningtimescanbeontheorder ofminutesforthelargeterrainsthatareoften used,whichaddsuptosubstantialidletimes(S tentz1994).
searches to find solutions to series of similar search tasks much faster than is possible by solving each search task from scratch. An overview is given in (Frigioni, Marchetti-Spaccamela, & Nanni 2000). Heuristic search methods, such as A* (Nilsson 1971), on the other hand, use heuristic knowledge in form of approximations of the goal distances
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: