Autor | Schattenberg, Bernd | dc.contributor.author |
Aufnahmedatum | 2016-03-14T15:19:51Z | dc.date.accessioned |
In OPARU verfügbar seit | 2016-03-14T15:19:51Z | dc.date.available |
Jahr der Erstellung | 2009 | dc.date.created |
Zusammenfassung | Planning and scheduling are well-established disciplines in the field of Artificial Intelligence. They provide flexibility, robustness, and effectiveness to complex software systems in a variety of application areas. While planning is the process of finding a course of action that achieves a goal or performs a specified task, scheduling deals with the assignment of resources and time to given activities, taking into account resource restrictions and temporal dependencies. In other words, planning focuses on reasoning about causal structures and identifying the necessary actions for achieving a specific goal; scheduling concentrates on resource consumption and production for optimizing a coherent parameter assignment of a plan. As successful these techniques clearly are, the actual demands of complex, real-world applications go far beyond the potential of these single methods, however. They require an adequate integration of these problem solving methods as well as a combination of different planning and scheduling paradigms. Particularly important are abstraction-based, hierarchical approaches because of both their expressive knowledge representation and their efficiency in finding solutions. Current state-of-the-art systems rarely address the question of method integration; isolated approaches do so only in ad hoc implementations and mostly lack a proper formal basis.
This thesis presents a formal framework for plan and schedule generation based on a well-founded conceptualization of refinement planning: An abstract problem specification is transformed stepwise into a concrete, executable solution. In each refinement step, plan deficiencies identify faulty or under-developed parts of the plan, which in turn triggers the generation of transformation operators that try to resolve them. All involved entities are explicitly represented and therefore transparent to the framework. This property allows for two novel aspects of our approach:
[...] | dc.description.abstract |
Sprache | en | dc.language.iso |
Verbreitende Stelle | Universität Ulm | dc.publisher |
Lizenz | Standard (Fassung vom 01.10.2008) | dc.rights |
Link zum Lizenztext | https://oparu.uni-ulm.de/xmlui/license_v2 | dc.rights.uri |
Schlagwort | Formal framework | dc.subject |
Schlagwort | Hybrid planning | dc.subject |
Schlagwort | Refinement-based planning | dc.subject |
DDC-Sachgruppe | DDC 004 / Data processing & computer science | dc.subject.ddc |
LCSH | Planning | dc.subject.lcsh |
LCSH | Scheduling | dc.subject.lcsh |
Titel | Hybrid planning and scheduling | dc.title |
Ressourcentyp | Dissertation | dc.type |
DOI | http://dx.doi.org/10.18725/OPARU-1045 | dc.identifier.doi |
PPN | 308570952 | dc.identifier.ppn |
URN | http://nbn-resolving.de/urn:nbn:de:bsz:289-vts-68953 | dc.identifier.urn |
GND | Automatische Handlungsplanung | dc.subject.gnd |
Fakultät | Fakultät für Ingenieurwissenschaften und Informatik | uulm.affiliationGeneral |
Datum der Freischaltung | 2009-07-08T22:48:55Z | uulm.freischaltungVTS |
Peer-Review | nein | uulm.peerReview |
Signatur Druckexemplar | Z: J-H 13.325; W: W-H 11.775 | uulm.shelfmark |
DCMI Medientyp | Text | uulm.typeDCMI |
VTS-ID | 6895 | uulm.vtsID |
Kategorie | Publikationen | uulm.category |