654 Hits in 4.3 sec

Watching and Acting Together: Concurrent Plan Recognition and Adaptation for Human-Robot Teams

Steven James Levine, Brian Charles Williams
2018 The Journal of Artificial Intelligence Research  
Pike makes choices based on the preconditions of actions in the plan, temporal constraints, unanticipated disturbances, and choices made previously (by either agent).Innovations of this work include (1  ...  This allows a single set of algorithms to find implicit constraints between sets of choices for the human and robot (as determined via causal link analysis and temporal reasoning), narrowing the possible  ...  We are particularly indebted to Christian Muise for a plethora of helpful technical discussions and insights relating to this research and earlier drafts of this paper, as well as to Andreas Hofmann for  ... 
doi:10.1613/jair.1.11243 fatcat:lcg5hn64jren7lqi6d7xeauoye

An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events

A. Gerevini, A. Saetti, I. Serina
2006 The Journal of Artificial Intelligence Research  
When actions have durations, handling such temporal constraints adds an extra difficulty to planning.  ...  We propose an approach to planning in these domains which integrates constraint-based temporal reasoning into a graph-based planning framework using local search.  ...  The work of Ivan Serina was in part carried out at the Department of Computer and Information Sciences of the University of Strathclyde (Glasgow, UK), and was supported by Marie Curie Fellowship N HPMF-CT  ... 
doi:10.1613/jair.1742 fatcat:62z3p3hiwffrlfablsjh4bjtqq

Assembling Learning Objects for Personalized Learning: An AI Planning Perspective

Antonio Garrido, Eva Onaindia
2013 IEEE Intelligent Systems  
the temporal and resource constraints to make the course applicable in a real scenario.  ...  The aim of educational systems is to assemble learning objects on a set of topics tailored to the goals and individual students' styles.  ...  , learning outcomes and, optionally, their temporal+resource constraints.  ... 
doi:10.1109/mis.2011.36 fatcat:lgcihd53qfguxggvhmeroeqsie

Automatic temporal layout mechanisms revisited

M. Cecelia Buchanan, Polle T. Zellweger
2005 ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)  
We also thank Larry Rowe for his suggestions on improving the organization and exposition of this article.  ...  ACKNOWLEDGMENTS We thank Laura Dorsey, Brett Wayland, and Michael Ormes for their support of the work discussed in Section 4.3.  ...  Some interesting algorithms include topological sort, all-pairs-shortest-path, linear programming, dynamic programming, constraint hierarchies, and incremental algorithms.  ... 
doi:10.1145/1047936.1047942 fatcat:roqu4jg5lzfqjhebytjqj62uim

Probabilistic Temporal Networks with Ordinary Distributions: Theory, Robustness and Expected Utility

Michael Saint-Guillain, Tiago Vaquero, Steve Chien, Jagriti Agrawal, Jordan Abrahams
2021 The Journal of Artificial Intelligence Research  
Most existing works in Probabilistic Simple Temporal Networks (PSTNs) base their frameworks on well-defined, parametric probability distributions.  ...  Under the operational contexts of both strong and dynamic control, this paper addresses robustness measure of PSTNs, i.e. the execution success probability, where the probability distributions of the contingent  ...  We thank Maxime Parmentier for his valuable suggestions at the very beginning of this research.  ... 
doi:10.1613/jair.1.13019 fatcat:rrvqaizio5f7ja4j62oy4k5xoe

Situation-aware composition and execution in dynamic environments by automated planning

Qiang Lu, Justin Wilson, Yixin Chen, Christopher Gill, Louis Thomas, Gruia-Catalin Roman, Guoliang Chen
2014 Engineering applications of artificial intelligence  
Results of experiments we have conducted show that our approach significantly broadens the scope of previous research by solving the challenges of availability, mobility, and communication constraints  ...  Our approach is based on the notion of open workflows, i.e., workflows that are constructed dynamically using available knowledge and services.  ...  network, dynamically generated workflow, fixed hosts No COW Transform to temporal planning Temporal planning (SGPlan) Decentralized control, mobile ad hoc network, dynamically generated workflow  ... 
doi:10.1016/j.engappai.2014.06.024 fatcat:yyfer5da45c3ngcbqn6bhrpbea

O-Plan: The open planning architecture

Ken Currie, Austin Tate
1991 Artificial Intelligence  
Temporal and resource constraint handling, shown to be valuable in realistic domains by Deviser 52], has been extended to provide a powerful search space pruning method.  ...  The algorithms for this are incremental versions of Operational Research methods. O-Plan has integrated ideas from or and AI in a coherent and constructive manner.  ...  In this case scheduling takes the form of adding to an existing set of temporal constraints which can berepresented without resorting to disjunction.  ... 
doi:10.1016/0004-3702(91)90024-e fatcat:govnb76wrndbhihae4g3crxmfu

Theory and practice of constraint handling rules

Thom Frühwirth
1998 The Journal of Logic Programming  
Constraint Handling Rules (CHR) are our proposal to allow more¯exibility and application-oriented customization of constraint systems.  ...  Going from theory to practice, we will de®ne syntax and semantics for CHR, introduce an important decidable property, con¯uence, of CHR programs and de®ne a tight integration of CHR with constraint logic  ...  possible change of values of symbols), schedule statements (statements that describes occurrences of and the temporal relations between actions).  ... 
doi:10.1016/s0743-1066(98)10005-5 fatcat:6x3qpbx3yva5nljfbrrgrtgvem

Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4

J. Hoffmann, S. Edelkamp, S. Thiebaux, R. Englert, F. Liporace, S. Trueg
2006 The Journal of Artificial Intelligence Research  
For the first time in the IPC, we used compilations to formulate complex domain features in simple languages such as STRIPS, rather than just dropping the more interesting problem constraints in the simpler  ...  They come from five different (potential) real-world applications of planning: airport ground traffic control, oil derivative transportation in pipeline networks, model-checking safety properties, power  ...  The dynamic creation of processes with PDDL would require a language extension for dynamic object creation.  ... 
doi:10.1613/jair.1982 fatcat:hmne5ycxj5gjtn5d2u5hz73dqu

As time goes by: Constraint Handling Rules - A survey of CHR research from 1998 to 2007 [article]

Jon Sneyers, Peter Van Weert, Tom Schrijvers, Leslie De Koninck
2009 arXiv   pre-print
Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions and applications.  ...  Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset rewrite rules.  ...  Secondly, soundness of negation-as-failure is achieved through incremental evaluation.  ... 
arXiv:0906.4474v2 fatcat:pmadjyra3vdublffzz5pjzlbxa

Strategic directions in constraint programming

Pascal Van Hentenryck, Vijay Saraswat
1996 ACM Computing Surveys  
Such applications are typically in the areas of scheduling (disjunctive constraints, task intervals), resource control (cumulative, bottlenecks), transportation (cycle constraints, labeling heuristics)  ...  manipulation, robustness, dynamic compilation to architecture-independent bytecode, dynamic databases, search facilities, grammars, code motion, and sophisticated metaprogramming.  ... 
doi:10.1145/242223.242279 fatcat:3aqe7rubijeddoahomxho2vtou

On-line Planning and Scheduling: An Application to Controlling Modular Printers

W. Ruml, M. B. Do, R. Zhou, M. P.J. Fromherz
2011 The Journal of Artificial Intelligence Research  
To our knowledge, this work represents the first successful industrial application of embedded domain-independent temporal planning.  ...  At its heart is an on-line algorithm that combines techniques from state-space planning and partial-order scheduling.  ...  Acknowledgments Much of this work was done while the first author was with the Palo Alto Research Center.  ... 
doi:10.1613/jair.3184 fatcat:gymwqinewvhphpseys3amaewyy

A hybrid model for a multiproduct pipeline planning and scheduling problem

Tony Minoru Tamura Lopes, Andre Augusto Ciré, Cid Carvalho de Souza, Arnaldo Vieira Moura
2009 Constraints  
In spite of being more economical and environmentally safer, the use of a complex pipeline network poses serious operational difficulties related to resource allocation and temporal constraints.  ...  Recurrently, it faces a very difficult planning and scheduling problem: how to operate a large pipeline network in order to adequately transport oil derivatives and biofuels from refineries to local markets  ...  The authors are also grateful to Fernando Marcellino and the team of engineers from petrobras-ti/sp.  ... 
doi:10.1007/s10601-009-9086-z fatcat:w2mkycog4jhyvou3tcq4qrfuju

As time goes by: Constraint Handling Rules

2009 Theory and Practice of Logic Programming  
Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions, and applications.  ...  Logic Programming, Special Issue on Constraint Logic Programming, 1998, vol. 37, nos. 1–3, pp. 95–138).  ...  Secondly, soundness of negation-as-failure is achieved through incremental evaluation.  ... 
doi:10.1017/s1471068409990123 fatcat:jlx6gexqqzht5blkoxzzelst6e

An Overview of AI Research in Italy [chapter]

Andrea Roli, Michela Milano
2009 Lecture Notes in Computer Science  
From a network perspective it appears to be scale-free. Next, we briefly illustrate the main subjects of investigation and applications.  ...  This chapter aims to provide an overview of the main Italian research areas and activities.  ...  On the application side, many fields have been investigated by Italian researchers: planning and scheduling (see Section 4), temporal reasoning [158, 163] , security and quality of service [37], bioinformatics  ... 
doi:10.1007/978-3-642-03226-4_10 fatcat:wsimnbii4fdptcyls2bqkt2wqu
« Previous Showing results 1 — 15 out of 654 results