scholarly journals A Sequential Composition Framework for Coordinating Multirobot Behaviors

2020 ◽  
pp. 1-13
Author(s):  
Pietro Pierpaoli ◽  
Anqi Li ◽  
Mohit Srinivasan ◽  
Xiaoyi Cai ◽  
Samuel Coogan ◽  
...  
Keyword(s):  
Sequential Composition

Composition of Functional Petri Nets

2013 ◽  
pp. 404-464 ◽  
Author(s):  
Dmitry A. Zaitsev
Keyword(s):  
Graph Theory ◽  
Petri Nets ◽  
Petri Net ◽  
Ad Hoc ◽  
Fundamental Equation ◽  
Weighted Graph ◽  
Sequential Composition ◽  
Speed Up ◽  
Networking Protocols ◽  
Linear Invariants

Functional Petri nets and subnets are introduced and studied for the purpose of speed-up of Petri nets analysis with algebraic methods. The authors show that any functional subnet may be generated by a composition of minimal functional subnets. They propose two ways to decompose a Petri net: via logical equations solution and with an ad-hoc algorithm, whose complexity is polynomial. Then properties of functional subnets are studied. The authors show that linear invariants of a Petri net may be computed from invariants of its functional subnets; similar results also hold for the fundamental equation of Petri nets. A technique for Petri nets analysis using composition of functional subnets is also introduced and studied. The authors show that composition-based calculation of invariants and solutions of fundamental equation provides a significant speed-up of computations. For an additional speed-up, they propose a sequential composition of functional subnets. Sequential composition is formalised in the terms of graph theory and was named the optimal collapse of a weighted graph. At last, the authors apply the introduced technique to the analysis of Petri net models of such well-known networking protocols as ECMA, TCP, BGP.

Feedback motion planning of unmanned surface vehicles via random sequential composition

2019 ◽  
Vol 41 (12) ◽  
pp. 3321-3330 ◽  
Author(s):  
Emre Ege ◽  
Mustafa Mert Ankarali
Keyword(s):  
Motion Planning ◽  
Broad Class ◽  
Random Trees ◽  
Main Approach ◽  
Unmanned Surface Vehicles ◽  
Sequential Composition ◽  
Planning Algorithm ◽  
Overall Performance ◽  
Simulation Results ◽  
Feasible Solutions

In this paper, we propose a new motion planning method that aims to robustly and computationally efficiently solve path planning and navigation problems for unmanned surface vehicles (USVs). Our approach is based on synthesizing two different existing methodologies: sequential composition of dynamic behaviours and rapidly exploring random trees (RRT). The main motivation of this integrated solution is to develop a robust feedback-based and yet computationally feasible motion planning algorithm for USVs. In order to illustrate the main approach and show the feasibility of the method, we performed simulations and tested the overall performance and applicability for future experimental applications. We also tested the robustness of the method under relatively extreme environmental uncertainty. Simulation results indicate that our method can produce robust and computationally feasible solutions for a broad class of USVs.

scholarly journals On sequential composition, action prefixes and process prefix

1994 ◽  
Vol 6 (3) ◽  
pp. 250-268 ◽  
Author(s):  
J. C. M. Baeten ◽  
J. A. Bergstra
Keyword(s):  
Sequential Composition

Rapid learning in sequential composition control

2014 ◽  
Author(s):  
Esmaeil Najafi ◽  
Gabriel A.D. Lopes ◽  
Subramanya P. Nageshrao ◽  
Robert Babuska
Keyword(s):  
Rapid Learning ◽  
Composition Control ◽  
Sequential Composition

scholarly journals Non-Determinism and the Dynamics of Knowledge

2017 ◽  
Author(s):  
Davide Grossi ◽  
Andreas Herzig ◽  
Wiebe van der Hoek ◽  
Christos Moyzes
Keyword(s):  
Epistemic Logic ◽  
Dynamic Logic ◽  
Dynamic Epistemic Logic ◽  
Propositional Dynamic Logic ◽  
Sequential Composition ◽  
Shed Light

In this paper we attempt to shed light on the concept of an agent’s knowledge after a non-deterministic action is executed. We start by making a comparison between notions of non-deterministic choice, and between notions of sequential composition, of settings with dynamic and/or epistemic character; namely Propositional Dynamic Logic (PDL), Dynamic Epistemic Logic (DEL), and the more recent logic of Semi-Public Environments (SPE). These logics represent two different approaches for defining the aforementioned actions, and in order to provide unified frameworks that encompass both, we define the logics DELVO (DEL+Vision+Ontic change) and PDLVE (PDL+Vision+Epistemic operators). DELVO is given a sound and complete axiomatisation.

Sign in / Sign up

Export Citation Format

Share Document