About: When Planning Should Be Easy: On Solving Cumulative Planning Problems     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
  • This paper deals with planning domains that appear in computer games, especially when modeling intelligent virtual agents. Some of these domains contain only actions with no negative effects and are thus treated as easy from the planning perspective. We propose two new techniques to solve the problems in these planning domains, a heuristic search algorithm ANA* and a constraint based planner RelaxPlan, and we compare them with the state of the art planners, that were successful in IPC, using planning domains motivated by computer games.
  • This paper deals with planning domains that appear in computer games, especially when modeling intelligent virtual agents. Some of these domains contain only actions with no negative effects and are thus treated as easy from the planning perspective. We propose two new techniques to solve the problems in these planning domains, a heuristic search algorithm ANA* and a constraint based planner RelaxPlan, and we compare them with the state of the art planners, that were successful in IPC, using planning domains motivated by computer games. (en)
Title
  • When Planning Should Be Easy: On Solving Cumulative Planning Problems
  • When Planning Should Be Easy: On Solving Cumulative Planning Problems (en)
skos:prefLabel
  • When Planning Should Be Easy: On Solving Cumulative Planning Problems
  • When Planning Should Be Easy: On Solving Cumulative Planning Problems (en)
skos:notation
  • RIV/00216208:11320/12:10129828!RIV13-GA0-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP103/10/1287), S
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
  • 180907
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/12:10129828
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • intelligent virtual agents; RelaxPlan; Cumulative Planning (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [C69E7BAFAC91]
http://linked.open...v/mistoKonaniAkce
  • Marco Island, USA
http://linked.open...i/riv/mistoVydani
  • Menlo Park
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference (FLAIRS 2012)
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
  • Brom, Cyril
  • Dvořák, Filip
  • Gemrot, Jakub
  • Toropila, Daniel
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • AAAI Press
https://schema.org/isbn
  • 978-1-57735-558-8
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