About: On Modeling Planning Problems: Experience From The Petrobras Challenge     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:seeAlso
Description
  • The International Planning Competitions have led to the development of the standard modeling framework for describing planning domains and problems Planning Domain Description Language (PDDL). The majority of planning research is done around problems modeled in PDDL though there are only a few applications adopting PDDL. The planning model of independent actions connected only via causal relations is very exible, but it also makes plans less predictable (plans look di erent than expected by the users) and it is probably also one of the reasons of bad practical eciency of current planners (visibly wrong plans are blindly explored by the planners). In this paper we argue that grouping actions into exible sub-plans is a way to overcome the eciency problems. The idea is that in- stead of seeing actions as independent entities that are causally connected via action preconditions and e ects, we suggest using a form of nite state automaton (FSA) to describe the expected sequences of actions. The arcs in FSA are annotated by conditions guiding the planner to explore only proper paths in the automaton. The second idea is composing primitive actions into meta-actions, which decreases the size of FSA and makes planning much faster. The main motivation is to give users more control over the action sequencing with two primary goals: obtaining more pre- dictable plans and improving eciency of planning. The presented ideas originate from solving the Petrobras logistic problem, where this technique outperformed classical planning models.
  • The International Planning Competitions have led to the development of the standard modeling framework for describing planning domains and problems Planning Domain Description Language (PDDL). The majority of planning research is done around problems modeled in PDDL though there are only a few applications adopting PDDL. The planning model of independent actions connected only via causal relations is very exible, but it also makes plans less predictable (plans look di erent than expected by the users) and it is probably also one of the reasons of bad practical eciency of current planners (visibly wrong plans are blindly explored by the planners). In this paper we argue that grouping actions into exible sub-plans is a way to overcome the eciency problems. The idea is that in- stead of seeing actions as independent entities that are causally connected via action preconditions and e ects, we suggest using a form of nite state automaton (FSA) to describe the expected sequences of actions. The arcs in FSA are annotated by conditions guiding the planner to explore only proper paths in the automaton. The second idea is composing primitive actions into meta-actions, which decreases the size of FSA and makes planning much faster. The main motivation is to give users more control over the action sequencing with two primary goals: obtaining more pre- dictable plans and improving eciency of planning. The presented ideas originate from solving the Petrobras logistic problem, where this technique outperformed classical planning models. (en)
Title
  • On Modeling Planning Problems: Experience From The Petrobras Challenge
  • On Modeling Planning Problems: Experience From The Petrobras Challenge (en)
skos:prefLabel
  • On Modeling Planning Problems: Experience From The Petrobras Challenge
  • On Modeling Planning Problems: Experience From The Petrobras Challenge (en)
skos:notation
  • RIV/00216208:11320/13:10195095!RIV14-GA0-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I, P(GAP202/10/1188)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 93751
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/13:10195095
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Petrobras Challenge; Modeling of Planning Problems (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [1F1FCD89E4CF]
http://linked.open...v/mistoKonaniAkce
  • Mariánské Lázně
http://linked.open...i/riv/mistoVydani
  • Jindřichův Hradec, Czech Republic
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 16th Czech-Japan Seminar on Data Analysis and Decision Making
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Barták, Roman
  • Zhou, Neng-Fa
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • Published by Faculty of Management, University of Economics
https://schema.org/isbn
  • 978-80-245-1950-0
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software