Articoli correlati a Local Search for Planning and Scheduling: ECAI 2000...

Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence): 2148 - Brossura

 
9783540428985: Local Search for Planning and Scheduling: ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence): 2148
Brossura
ISBN 10: 3540428984 ISBN 13: 9783540428985
Casa editrice: Springer, 2001

Sinossi

Thenextsetofarticlesdealwithplanningsystemsthatareabletoinc- porateresourcereasoning. The?rstarticle,ofwhichIamtheauthor,makesit clearwhyconventionalplanningsystemscannotproperlyhandleplanningwith resourcesandgivesanoverviewoftheconstraint-basedExcaliburagent’spl- ningsystem,whichdoesnothavetheserestrictions. Thenextthreearticlesare aboutNASAJPL’sASPEN/CASPERsystem. The?rstone–byChien,Knight, andRabideau–focusesonthereplanningcapabilitiesoflocalsearchmethods, presentingtwoempiricalstudiesinwhichacontinuousplanningprocessclearly outperformsarestartstrategy. Thenextarticle,byEngelhardtandChien,shows howlearningcanbeusedtospeedupthesearchforaplan. Thegoalisto?nda setofsearchheuristicsthatguidethesearchaswellaspossible. Thelastarticle inthisblock–byKnight,Rabideau,andChien–proposesanddemonstrates, a technique for aggregating single search moves so that distant states can be reachedmoreeasily. VI Preface Thelastthreearticlesinthisbookaddresstopicsthatarenotdirectlyrelated tolocalsearch,butthedescribedmethodsmakeverylocaldecisionsduringthe search. RefanidisandVlahavasdescribeextensionstotheGRTplanner,e. g. ,a hill-climbingstrategyforactionselection. Theextensionsresultinmuchbetter performancethanwiththeoriginalGRTplanner. Thesecondarticle–byO- india, Sebastia, and Marzal – presents a planning algorithm that successively re?nes a start graph by di?erent phases, e. g. , a phase to guarantee comp- teness. Inthelastarticle,HiraishiandMizoguchipresentasearchmethodfor constructingaroutemap. Constraintswithrespecttomemoryandtimecanbe incorporatedintothesearchprocess. Iwishtoexpressmygratitudetothemembersoftheprogramcommittee, whoactedasreviewersfortheworkshopandthisvolume. Iwouldalsoliketo thank all those who helped to make this workshop a success – including, of course,theparticipantsandtheauthorsofpapersinthisvolume. June2001 AlexanderNareyek WorkshopChair ProgramCommittee EmileH. L. Aarts PhilipsResearch Jos´eLuisAmbite Univ. ofSouthernCalifornia BlaiBonet UniversityofCalifornia RonenI. Brafman Ben-GurionUniversity SteveChien NASAJPL AndrewDavenport IBMT. J. Watson AlfonsoGerevini Universit`adiBrescia HolgerH. Hoos Univ. ofBritishColumbia AlexanderNareyek GMDFIRST AngeloOddi IP-CNR Mar´?aC. Ri? Univ. T´ec. Fed. SantaMar´?a BartSelman CornellUniversity EdwardTsang UniversityofEssex TableofContents InvitedPaper Meta-heuristics:TheStateoftheArt. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 StefanVoß CombinatorialOptimization SolvingtheSportsLeagueSchedulingProblemwithTabuSearch . . . . . . . . 24 Jean-PhilippeHamiez,Jin-KaoHao LagrangeMultipliersforLocalSearchonPlanningGraphs . . . . . . . . . . . . . . 37 AlfonsoGerevini,IvanSerina PlanningwithResources BeyondthePlan-LengthCriterion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 AlexanderNareyek AnEmpiricalEvaluationoftheE?ectiveness ofLocalSearchforReplanning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 SteveChien,RussellKnight,GreggRabideau Board-LayingTechniquesImproveLocalSearch inMixedPlanningandScheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 RussellKnight,GreggRabideau,SteveChien EmpiricalEvaluationofLocalSearchMethods forAdaptingPlanningPoliciesinaStochasticEnvironment. . . . . . . . . . . . . 108 BarbaraEngelhardt,SteveChien RelatedApproaches TheGRTPlanner:NewResults . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 IoannisRefanidis,IoannisVlahavas IncrementalLocalSearchforPlanningProblems. . . . . . . . . . . . . . . . . . . . . . . 139 EvaOnaindia,LauraSebastia,EliseoMarzal MapDrawingBasedonaResource-ConstrainedSearch foraNavigationSystem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158 HironoriHiraishi,FumioMizoguchi AuthorIndex . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171 Meta-heuristics:TheStateoftheArt StefanVoß TechnischeUniversit¨at

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Dalla quarta di copertina

Thenextsetofarticlesdealwithplanningsystemsthatareabletoinc- porateresourcereasoning. The?rstarticle,ofwhichIamtheauthor,makesit clearwhyconventionalplanningsystemscannotproperlyhandleplanningwith resourcesandgivesanoverviewoftheconstraint-basedExcaliburagent'spl- ningsystem,whichdoesnothavetheserestrictions. Thenextthreearticlesare aboutNASAJPL'sASPEN/CASPERsystem. The?rstone-byChien,Knight, andRabideau-focusesonthereplanningcapabilitiesoflocalsearchmethods, presentingtwoempiricalstudiesinwhichacontinuousplanningprocessclearly outperformsarestartstrategy. Thenextarticle,byEngelhardtandChien,shows howlearningcanbeusedtospeedupthesearchforaplan. Thegoalisto?nda setofsearchheuristicsthatguidethesearchaswellaspossible. Thelastarticle inthisblock-byKnight,Rabideau,andChien-proposesanddemonstrates, a technique for aggregating single search moves so that distant states can be reachedmoreeasily. VI Preface Thelastthreearticlesinthisbookaddresstopicsthatarenotdirectlyrelated tolocalsearch,butthedescribedmethodsmakeverylocaldecisionsduringthe search. RefanidisandVlahavasdescribeextensionstotheGRTplanner,e. g. ,a hill-climbingstrategyforactionselection. Theextensionsresultinmuchbetter performancethanwiththeoriginalGRTplanner. Thesecondarticle-byO- india, Sebastia, and Marzal - presents a planning algorithm that successively re?nes a start graph by di?erent phases, e. g. , a phase to guarantee comp- teness. Inthelastarticle,HiraishiandMizoguchipresentasearchmethodfor constructingaroutemap. Constraintswithrespecttomemoryandtimecanbe incorporatedintothesearchprocess. Iwishtoexpressmygratitudetothemembersoftheprogramcommittee, whoactedasreviewersfortheworkshopandthisvolume. Iwouldalsoliketo thank all those who helped to make this workshop a success - including, of course,theparticipantsandtheauthorsofpapersinthisvolume. June2001 AlexanderNareyek WorkshopChair ProgramCommittee EmileH. L. Aarts PhilipsResearch Jos¿eLuisAmbite Univ. ofSouthernCalifornia BlaiBonet Universityof

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer
Data di pubblicazione
2001
Lingua
Inglese
ISBN 10 
3540428984
ISBN 13 
9783540428985
Rilegatura
Copertina flessibile
Numero di pagine
176
Redattore
Nareyek Alexander
Contatto del produttore
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Germania