10,247 research outputs found
Cooperative Task Planning of Multi-Agent Systems Under Timed Temporal Specifications
In this paper the problem of cooperative task planning of multi-agent systems
when timed constraints are imposed to the system is investigated. We consider
timed constraints given by Metric Interval Temporal Logic (MITL). We propose a
method for automatic control synthesis in a two-stage systematic procedure.
With this method we guarantee that all the agents satisfy their own individual
task specifications as well as that the team satisfies a team global task
specification.Comment: Submitted to American Control Conference 201
Probabilistic Plan Synthesis for Coupled Multi-Agent Systems
This paper presents a fully automated procedure for controller synthesis for
multi-agent systems under the presence of uncertainties. We model the motion of
each of the agents in the environment as a Markov Decision Process (MDP)
and we assign to each agent one individual high-level formula given in
Probabilistic Computational Tree Logic (PCTL). Each agent may need to
collaborate with other agents in order to achieve a task. The collaboration is
imposed by sharing actions between the agents. We aim to design local control
policies such that each agent satisfies its individual PCTL formula. The
proposed algorithm builds on clustering the agents, MDP products construction
and controller policies design. We show that our approach has better
computational complexity than the centralized case, which traditionally suffers
from very high computational demands.Comment: IFAC WC 2017, Toulouse, Franc
Decentralized Abstractions and Timed Constrained Planning of a General Class of Coupled Multi-Agent Systems
This paper presents a fully automated procedure for controller synthesis for
a general class of multi-agent systems under coupling constraints. Each agent
is modeled with dynamics consisting of two terms: the first one models the
coupling constraints and the other one is an additional bounded control input.
We aim to design these inputs so that each agent meets an individual high-level
specification given as a Metric Interval Temporal Logic (MITL). Furthermore,
the connectivity of the initially connected agents, is required to be
maintained. First, assuming a polyhedral partition of the workspace, a novel
decentralized abstraction that provides controllers for each agent that
guarantee the transition between different regions is designed. The controllers
are the solution of a Robust Optimal Control Problem (ROCP) for each agent.
Second, by utilizing techniques from formal verification, an algorithm that
computes the individual runs which provably satisfy the high-level tasks is
provided. Finally, simulation results conducted in MATLAB environment verify
the performance of the proposed framework
Using genetic algorithms to generate test sequences for complex timed systems
The generation of test data for state based specifications is a computationally expensive process. This problem is magnified if we consider that time con- straints have to be taken into account to govern the transitions of the studied system. The main goal of this paper is to introduce a complete methodology, sup- ported by tools, that addresses this issue by represent- ing the test data generation problem as an optimisa- tion problem. We use heuristics to generate test cases. In order to assess the suitability of our approach we consider two different case studies: a communication protocol and the scientific application BIPS3D. We give details concerning how the test case generation problem can be presented as a search problem and automated. Genetic algorithms (GAs) and random search are used to generate test data and evaluate the approach. GAs outperform random search and seem to scale well as the problem size increases. It is worth to mention that we use a very simple fitness function that can be eas- ily adapted to be used with other evolutionary search techniques
Model Predictive Control for Signal Temporal Logic Specification
We present a mathematical programming-based method for model predictive
control of cyber-physical systems subject to signal temporal logic (STL)
specifications. We describe the use of STL to specify a wide range of
properties of these systems, including safety, response and bounded liveness.
For synthesis, we encode STL specifications as mixed integer-linear constraints
on the system variables in the optimization problem at each step of a receding
horizon control framework. We prove correctness of our algorithms, and present
experimental results for controller synthesis for building energy and climate
control
Modeling Bitcoin Contracts by Timed Automata
Bitcoin is a peer-to-peer cryptographic currency system. Since its
introduction in 2008, Bitcoin has gained noticeable popularity, mostly due to
its following properties: (1) the transaction fees are very low, and (2) it is
not controlled by any central authority, which in particular means that nobody
can "print" the money to generate inflation. Moreover, the transaction syntax
allows to create the so-called contracts, where a number of
mutually-distrusting parties engage in a protocol to jointly perform some
financial task, and the fairness of this process is guaranteed by the
properties of Bitcoin. Although the Bitcoin contracts have several potential
applications in the digital economy, so far they have not been widely used in
real life. This is partly due to the fact that they are cumbersome to create
and analyze, and hence risky to use.
In this paper we propose to remedy this problem by using the methods
originally developed for the computer-aided analysis for hardware and software
systems, in particular those based on the timed automata. More concretely, we
propose a framework for modeling the Bitcoin contracts using the timed automata
in the UPPAAL model checker. Our method is general and can be used to model
several contracts. As a proof-of-concept we use this framework to model some of
the Bitcoin contracts from our recent previous work. We then automatically
verify their security in UPPAAL, finding (and correcting) some subtle errors
that were difficult to spot by the manual analysis. We hope that our work can
draw the attention of the researchers working on formal modeling to the problem
of the Bitcoin contract verification, and spark off more research on this
topic
- âŠ