2007 IEEE/RSJ International Conference on Intelligent Robots and Systems 2007
DOI: 10.1109/iros.2007.4399365
|View full text |Cite
|
Sign up to set email alerts
|

Modelling, analysis and execution of robotic tasks using petri nets

Abstract: This paper introduces Petri net based models of robotic tasks, which can be used to analyse and synthesise task plans, taking into account a Petri net model that abstracts the relevant features from the robot environment as well. Logical analysis concerning deadlocks and resource conservation can be performed over the ordinary version of the model. A task plan modeled by a Petri net can be extracted from the generalised stochastic version of the model, representing the optimal plan given a probabilistic measur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 46 publications
(32 citation statements)
references
References 6 publications
(8 reference statements)
0
30
0
Order By: Relevance
“…The Petri-net-based controller is, however, executed from a central computer, which communicates with the robots. Petri-nets for multi-robot control have been analysed to detect properties such as boundedness, livelocks, and deadlocks (Costelha and Lima 2008).…”
Section: Formal Methods In Swarm Roboticsmentioning
confidence: 99%
“…The Petri-net-based controller is, however, executed from a central computer, which communicates with the robots. Petri-nets for multi-robot control have been analysed to detect properties such as boundedness, livelocks, and deadlocks (Costelha and Lima 2008).…”
Section: Formal Methods In Swarm Roboticsmentioning
confidence: 99%
“…[5] Many other researchers have derived sequences of motion primitives by using geometric constraints [19][20][21] and Petri nets. [22,23] We explained the derivation of skill primitives by decomposing manipulation tasks. On the other hand, when the task which should be performed was designated, it's almost possible to compose a task by connecting skill primitives.…”
Section: Composition Of Skill Sequencementioning
confidence: 99%
“…The set of propositional symbols associated with a PN system model is Π = E ∪ D. We assume that all our PN system models are propositionally consistent, i.e., for all M ∈ R(G) and d ∈ D, M(µ(¬d)) + M(µ(d)) = 1. Propositionally consistent PN system models always have, for each d, one token in one of the places representing a truth value for d and zero 2 Hence, each p ∈ P D corresponds to exactly one literal l ∈ lit(D), thus |P D | = 2|D|, where |.| denotes the number of elements of the set. tokens in the other.…”
Section: B Petri Net Model Of a Robotic Taskmentioning
confidence: 99%
“…Due to its suitability to model concurrent systems and the wide range on analysis methods available, PNs have been used for the modelling and execution of (multi-)robot tasks [14,2]. There has also been a considerable amount of work on the control of PNs.…”
Section: Introductionmentioning
confidence: 99%