Nareyek | Local Search for Planning and Scheduling | Buch | 978-3-540-42898-5 | www.sack.de

Buch, Englisch, 176 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 289 g

Reihe: Lecture Notes in Computer Science

Nareyek

Local Search for Planning and Scheduling

ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers
Erscheinungsjahr 2001
ISBN: 978-3-540-42898-5
Verlag: Springer

ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers

Buch, Englisch, 176 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 289 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-42898-5
Verlag: Springer


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¨atBraunschweig Institutfur ¨ Wirtschaftswissenschaften Abt-Jerusalem-Straße7 D-38106Braunschweig,Germany stefan. voss@tu-bs. de Abstract.

Nareyek Local Search for Planning and Scheduling jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


Invited Paper.- Meta-heuristics: The State of the Art.- Combinatorial Optimization.- Solving the Sports League Scheduling Problem with Tabu Search.- Lagrange Multipliers for Local Search on Planning Graphs.- Planning with Resources.- Beyond the Plan-Length Criterion.- An Empirical Evaluation of the Effectiveness of Local Search for Replanning.- Board-Laying Techniques Improve Local Search in Mixed Planning and Scheduling.- Empirical Evaluation of Local Search Methods for Adapting Planning Policies in a Stochastic Environment.- Related Approaches.- The GRT Planner: New Results.- Incremental Local Search for Planning Problems.- Map Drawing Based on a Resource-Constrained Search for a Navigation System.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.