Abstract | ||
---|---|---|
In this paper, we propose an automated method for planning a team of mobile robots such that a Boolean-based mission is accomplished. The task consists of logical requirements over some regions of interest for the agents' trajectories and for their final states. In other words, we allow combinatorial specifications defining desired final states whose attainment includes visits to, avoidance of, an... |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/TAC.2017.2760249 | IEEE Transactions on Automatic Control |
Keywords | Field | DocType |
Robots,Petri nets,Trajectory,Computational modeling,Planning,Collision avoidance | Motion planning,Mathematical optimization,Petri net,Computer science,Stochastic Petri net,Theoretical computer science,Integer programming,Robot,Linear inequality,Mobile robot,Binary number | Journal |
Volume | Issue | ISSN |
63 | 7 | 0018-9286 |
Citations | PageRank | References |
4 | 0.42 | 18 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Cristian Mahulea | 1 | 161 | 19.50 |
Marius Kloetzer | 2 | 476 | 29.21 |