de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Mixed Integer Programming Models for Planning Problems

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44149

Bockmayr,  Alexander
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44325

Dimopoulos,  Yannis
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Bockmayr, A., & Dimopoulos, Y. (1998). Mixed Integer Programming Models for Planning Problems. In J. Frank, & M. Sabin (Eds.), Proceedings of the Workshop on Constraint Problem Reformulation (CP-98) (pp. 1-6). Moffett Field, USA: NASA Ames Research Center.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-3856-5
Zusammenfassung
We present some preliminary work on modeling AI planning as a Mixed Integer Programming (MIP) problem. We discuss the main advantages and disadvantages of the approach and compare it to traditional planning frameworks. We investigate a number of MIP models of specific problems, each of them exploiting different strengths of the MIP formulation, and present our computational experience with these models.