Filters








1,083 Hits in 6.4 sec

Cooperative project scheduling with controllable processing times: A game theory framework

Cyril Briand, Jean-Charles Billaut
2011 ETFA2011  
This paper considers a project-scheduling environment assuming that the activities of the project network are distributed among a set of actors (or agents).  ...  For performing the project, actors have to collaborate with each other intending to satisfy the desired project duration, defined by the project customer as a time interval.  ...  In multi-agent scheduling, several authors also consider the connection between the optimization of one global objective function, also called social objective, and game theory.  ... 
doi:10.1109/etfa.2011.6059081 dblp:conf/etfa/BriandB11 fatcat:nsoivakp5ffhzeim6pkplwvk7m

On optimal and sub-optimal control in the presence of adversaries 1

Oded Maler
2004 IFAC Proceedings Volumes  
This paper constitutes a sketch of a unified framework for posing and solving problems of optimal control in the presence of uncontrolled disturbances.  ...  After laying down the general framework we look closely at a concrete instance where the controller is a scheduler and the disturbances are related to uncertainties in task durations.  ...  Consequently, I provide no references to the first part of the paper. The results concerning scheduling were obtained in collaboration with Y. Abdeddaïm and E. Asarin.  ... 
doi:10.1016/s1474-6670(17)30713-9 fatcat:2xxy4jjppzf3lok4u3wq25xbqm

Coordination by design and the price of autonomy

Adriaan ter Mors, Chetan Yadati, Cees Witteveen, Yingqian Zhang
2009 Autonomous Agents and Multi-Agent Systems  
We consider a multi-agent planning problem as a set of activities that has to be planned by several autonomous agents.  ...  account the price of autonomy: the ratio of the costs of a solution obtained by coordinating selfish agents versus the costs of an optimal solution.  ...  This work was part of the research project "Market based task coordination in multi-agent planning" which was financially supported by the Netherlands Organization for Scientific Research (NWO).  ... 
doi:10.1007/s10458-009-9086-9 fatcat:di4d4atwgfbbrbofhddoqm3xci

The 10,000 Facets of MDP Model Checking [chapter]

Christel Baier, Holger Hermanns, Joost-Pieter Katoen
2019 Lecture Notes in Computer Science  
We focus on Markov decision processes (MDPs, for short).  ...  We discuss in particular the manifold facets of this field of research by surveying the verification of various MDP extensions, rich classes of properties, and their applications.  ...  ., mobile robot navigation, probabilistic planning and multi-agent systems where each agent can access its own variables, but cannot view the variables and locations of the other agents.  ... 
doi:10.1007/978-3-319-91908-9_21 fatcat:yjsuwb5ibjff3cq3niatu6sbxq

Interdiction Games on Markovian PERT Networks

Eli Gutin, Daniel Kuhn, Wolfram Wiesemann
2015 Management science  
some of the project tasks.  ...  In a stochastic interdiction game a proliferator aims to minimize the expected duration of a nuclear weapons development project, while an interdictor endeavors to maximize the project duration by delaying  ...  Table 6 compares the optimal interdiction schedules for the crashing game of Section 4.2.  ... 
doi:10.1287/mnsc.2014.1973 fatcat:zpaeczxw5zee3i7wvd2lm4wqu4

Decentralized allocation of tasks with temporal and precedence constraints to a team of robots

Ernesto Nunes, Mitchell McIntire, Maria Gini
2016 2016 IEEE International Conference on Simulation, Modeling, and Programming for Autonomous Robots (SIMPAR)  
Multi-task robots and multi-robot task problems can also be modeled as cooperative games with overlapping coalitions.  ...  For instance, [143] formulated ST-MR MRTA as a stochastic game and used overlapping potential games to approximate an optimal solution.  ... 
doi:10.1109/simpar.2016.7862396 dblp:conf/simpar/NunesMG16 fatcat:uxfvmpmmxbbwzn7zm232eob7mu

An Intelligent Architecture for Autonomous Virtual Agents Inspired by Onboard Autonomy [chapter]

Kaveh Hassani, Won-Sook Lee
2015 Advances in Intelligent Systems and Computing  
In this paper, we propose a generic architecture for developing autonomous virtual agents that let them to illustrate robust deliberative and reactive behaviors, concurrently.  ...  Intelligent virtual agents function in dynamic, uncertain, and uncontrolled environments, and animating them is a chaotic and error-prone task which demands high-level behavioral controllers to be able  ...  As an example, CIGA [27] is a middleware that amalgamates an arbitrary multi-agent system with a game engine by employing domain ontology.  ... 
doi:10.1007/978-3-319-11313-5_35 fatcat:xhtemm43yfdrjaztzejjdt6dpq

Model Checking Real-Time Systems [chapter]

Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Joël Ouaknine, James Worrell
2018 Handbook of Model Checking  
We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time.  ...  This chapter surveys timed automata as a formalism for model checking real-time systems.  ...  Acknowledgement We thank the reviewers for their numerous comments, remarks and additional references, which greatly helped us improve this chapter.  ... 
doi:10.1007/978-3-319-10575-8_29 fatcat:thsp3udcpnfyjpjzn6i2slbplm

Context-Aware Route Planning [chapter]

Adriaan W. ter Mors, Cees Witteveen, Jonne Zutt, Fernando A. Kuipers
2010 Lecture Notes in Computer Science  
Each agent wants to find a shortest-time route plan without colliding with any of the other agents, or ending up in a deadlock situation.  ...  Although neither approach can guarantee optimality with regard to the total set of agent route plans -and indeed examples can be constructed to show that either approach can outperform the other -our experiments  ...  An optimal multi-agent plan is for all agents to stay in their respective corridors. In figure 3 we see an infrastructure with two long corridors of resources.  ... 
doi:10.1007/978-3-642-16178-0_14 fatcat:qolyuf2cyrdthpahelkdjkpp6u

Competing for Resources: Estimating Adversary Strategy for Effective Plan Generation

Lukáš Chrpa, Pavel Rytíř, Rostislav Horčík, Stefan Edelkamp
2022 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In this paper we propose a novel approach for estimating strategies of the adversary (or the competitor), sampling its actions that might hinder agent's goals by interfering with the agent's actions.  ...  Decision-making techniques such as Automated planning have to take into account possible actions of adversary (or competing) agents.  ...  Acknowledgements We thank Jan Čuhel and Anastasiia Livochka for their help in the initial stages of the implementation.  ... 
doi:10.1609/aaai.v36i9.21205 fatcat:yhy2mmvsvfbn7lzj7grdqmjmsu

Distributed Constraint Optimization Problems and Applications: A Survey

Ferdinando Fioretto, Enrico Pontelli, William Yeoh
2018 The Journal of Artificial Intelligence Research  
The field of multi-agent system (MAS) is an active area of research within artificial intelligence, with an increasingly important impact in industrial and other real-world applications.  ...  Distributed Constraint Optimization Problems (DCOPs) have emerged as a prominent agent model to govern the agents' autonomous behavior, where both algorithms and communication models are driven by the  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their valuable comments and suggestions to improve the quality of the paper.  ... 
doi:10.1613/jair.5565 fatcat:zeou5gji5fas3h27ab4jxvtwkq

Hybrid mission planning with coalition formation

Anton Dukeman, Julie A. Adams
2017 Autonomous Agents and Multi-Agent Systems  
Multi-agent planning can be approached from a game theory perspective.  ...  These approaches work well for problems with a one-to-one mapping of agents to tasks, but multi-agent tasks will require more agents and more complex task allocation and path planning schemes.  ...  Appendix B Planning Domains This appendix presents the MACPDDL version of each domain used in the experiments for this dissertation. (:predicates 10 (at_rover ?x -rover ?y -waypoint) 11 (at_lander ?  ... 
doi:10.1007/s10458-017-9367-7 fatcat:7yfaoxfihvhtffvbxxxxro6ezi

Access Controlled Temporal Networks

Carlo Combi, Roberto Posenato, Luca Viganò, Matteo Zavatteri
2017 Proceedings of the 9th International Conference on Agents and Artificial Intelligence  
Dynamic controllability (DC) of ACTNs ensures the existence of an execution strategy, able to assign tasks to authorized users dynamically, satisfying all the relevant authorization constraints no matter  ...  We define Access-Controlled Temporal Networks (ACTNs) as an extension of Conditional Simple Temporal Networks with Uncertainty (CSTNUs).  ...  The minimal and maximal durations for this task are 5 and 10 minutes, respectively.  ... 
doi:10.5220/0006185701180131 dblp:conf/icaart/CombiP0Z17 fatcat:tj6ty6ux65g7nmwktkh5m2bxmm

Contextualize Me – The Case for Context in Reinforcement Learning [article]

Carolin Benjamins, Theresa Eimer, Frederik Schubert, Aditya Mohan, André Biedenkapp, Bodo Rosenhahn, Frank Hutter, Marius Lindauer
2022 arXiv   pre-print
To this end, we introduce the first benchmark library designed for generalization based on cRL extensions of popular benchmarks, CARL. In short: Context matters!  ...  We show that theoretically optimal behavior in contextual Markov Decision Processes requires explicit context information.  ...  The current context in an episode is selected with a round-robin schedule.  ... 
arXiv:2202.04500v1 fatcat:ci72otzw6raqfp5jr6567jvz5u

A Survey on Demand Response Programs in Smart Grids: Pricing Methods and Optimization Algorithms

John S. Vardakas, Nizar Zorba, Christos V. Verikoukis
2015 IEEE Communications Surveys and Tutorials  
We also present various optimization models for the optimal control of the DR strategies that have been proposed so far.  ...  Index Terms-Smart grid, demand response, pricing methods, optimization algorithms. J. S. Vardakas is with Iquadrat,  ...  Similarly, a Stackelberg game model is used in [119] for the optimal scheduling of loads.  ... 
doi:10.1109/comst.2014.2341586 fatcat:fmcjmwp3pbgvfm3j4rtky4xnnm
« Previous Showing results 1 — 15 out of 1,083 results