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... (7 risultati)

Paperback. Condizione: New.

Paperback. Condizione: Brand New. 1st edition. 169 pages. 9.25x6.25x0.25 inches. In Stock.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Withtheincreasingdeploymentofplanningandschedulingsystems,developer s oftenhavetodealwithverylargesearchspaces,real-timeperformancedemands, anddynamicenvironments. Completere nementmethodsdonotscalewell,- kinglocalsearchmethodstheonlypracticalalternative. Adynamicenvironment alsopromotestheapplicationoflocalsearch,thesearchheuristicsnotnormally beinga ectedbymodi cationsofthesearchspace. Furthermore,localsearchis wellsuitedforanytimerequirementsbecausetheoptimizationgoalisimproved iteratively. Suchadvantagesareo setbytheincompletenessofmostlocalsearch methods,whichmakesitimpossibletoprovetheinconsistencyoroptimalityof thesolutionsgenerated. Popularlocalsearchapproachesincludeevolutionary- gorithms,simulatedannealing,tabusearch,min-con icts,GSAT,andWalksat. The rstarticleinthisbook aninvitedcontributionbyStefanVoß givesan overviewofthesemethods. ThebookisbasedonthecontributionstotheWorkshoponLocalSearchfor Planning&Scheduling,heldonAugust21,2000atthe14thEuropeanCon- renceonArti cialIntelligence(ECAI2000)inBerlin,Germany. Theworkshop broughttogetherresearchersfromtheplanningandschedulingcommunitiesto explorethesetopicswithrespecttolocalsearchprocedures. Aftertheworkshop, asecondreviewprocessresultedinthecontributionstothepresentvolume. Voß soverviewisfollowedbytwoarticles,byHamiezandHaoandGerevini andSerina,onspeci c classical combinatorialsearchproblems. Thearticleby HamiezandHaoaddressestheproblemofsports-leaguescheduling,presenting results achieved by a tabu search method based on a neighborhood of value swaps. GereviniandSerina sarticleaddressesthetopicthatdominatestherest ofthebook:actionplanning. Itbuildsontheirpreviousworkonlocalsearch onplanninggraphs,presentinganewsearchguidanceheuristicwithdynamic parametertuning. 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.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Withtheincreasingdeploymentofplanningandschedulingsystems,developers oftenhavetodealwithverylargesearchspaces,real-timeperformancedemands, anddynamicenvironments. Completere nementmethodsdonotscalewell,- kinglocalsearchmethodstheonlypracticalalternative. Adynamicenvironment alsopromotestheapplicationoflocalsearch,thesearchheuristicsnotnormally beinga ectedbymodi cationsofthesearchspace. Furthermore,localsearchis wellsuitedforanytimerequirementsbecausetheoptimizationgoalisimproved iteratively. Suchadvantagesareo setbytheincompletenessofmostlocalsearch methods,whichmakesitimpossibletoprovetheinconsistencyoroptimalityof thesolutionsgenerated. Popularlocalsearchapproachesincludeevolutionary- gorithms,simulatedannealing,tabusearch,min-con icts,GSAT,andWalksat. The rstarticleinthisbook aninvitedcontributionbyStefanVoß givesan overviewofthesemethods. ThebookisbasedonthecontributionstotheWorkshoponLocalSearchfor Planning&Scheduling,heldonAugust21,2000atthe14thEuropeanCon- renceonArti cialIntelligence(ECAI2000)inBerlin,Germany. Theworkshop broughttogetherresearchersfromtheplanningandschedulingcommunitiesto explorethesetopicswithrespecttolocalsearchprocedures. Aftertheworkshop, asecondreviewprocessresultedinthecontributionstothepresentvolume . Voß soverviewisfollowedbytwoarticles,byHamiezandHaoandGerevini andSerina,onspeci c classical combinatorialsearchproblems. Thearticleby HamiezandHaoaddressestheproblemofsports-leaguescheduling,presenting results achieved by a tabu search method based on a neighborhood of value swaps. GereviniandSerina sarticleaddressesthetopicthatdominatestherest ofthebook:actionplanning. Itbuildsontheirpreviousworkonlocalsearch onplanninggraphs,presentinganewsearchguidanceheuristicwithdynam ic parametertuning. 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 184 pp. Englisch.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 .

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Thenextsetofarticlesdealwithplanningsystemsthatareabletoinc- porateresourcereasoning. The rstarticle,ofwhichIamtheauthor,makesit clearwhyconventionalplanningsystemscannotproperlyhandleplanningwith resourcesandgivesanoverviewoftheconstraint-basedExcaliburagent¿spl- ningsystem,whichdoesnothavetheserestrictions. Thenextthreearticlesare aboutNASAJPL¿sASPEN/CASPERsystem. The rstone¿byChien,Knight, andRabideaü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 UniversityofSpringer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 184 pp. Englisch.

Taschenbuch. Condizione: Neu. Local Search for Planning and Scheduling | ECAI 2000 Workshop, Berlin, Germany, August 21, 2000. Revised Papers | Alexander Nareyek | Taschenbuch | viii | Englisch | 2001 | Springer | EAN 9783540428985 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.