Napredna pretraga

Pregled bibliografske jedinice broj: 642756

Minimum Startup Delay Approach to Coordination of Multiple Mobile Robots Motion Along Predefined Paths


Petrinić, Toni; Brezak, Mišel; Petrović, Ivan
Minimum Startup Delay Approach to Coordination of Multiple Mobile Robots Motion Along Predefined Paths // Proceedings of the RAAD 2013 22nd International Workshop on Robotics in Alpe-Adria-Danube Region / Bojan Nemec and Leon Žlajpah (ur.).
Portorož, Slovenija, 2013. str. 370-375 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


Naslov
Minimum Startup Delay Approach to Coordination of Multiple Mobile Robots Motion Along Predefined Paths

Autori
Petrinić, Toni ; Brezak, Mišel ; Petrović, Ivan

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of the RAAD 2013 22nd International Workshop on Robotics in Alpe-Adria-Danube Region / Bojan Nemec and Leon Žlajpah - Portorož, Slovenija, 2013, 370-375

ISBN
978-961-264-064-4

Skup
22nd International Workshop on Robotics in Alpe- Adria-Danube Region

Mjesto i datum
Portorož, Slovenija, 11-13. 09. 2013

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Multiple Mobile Robots ; Cooperative Control ; Time Optimal Motion Planning

Sažetak
This paper is concerned with the collision free motion coordination of multiple mobile robots sharing the same workspace. To successfully coordinate motion of multiple mobile robots, a common approach is to assign priority level to each mobile robot. A mobile robot with highest priority takes into account only static obstacles while other mobile robots have to take into account also dynamic obstacles, which are the mobile robots with higher priorities. In this paper we propose a method for dynamic obstacles avoidance based on avoiding time-obstacles in the collision map. A mobile robot efficiently avoids the timeobstacles by inserting minimum needed startup delay time of its original trajectory along the predefined path. By applying the same principle to all lower priority robots a collision free motion coordination of multiple mobile robots can be achieved. A proposed method is fast and more intuitive then delaying nonlinear traveling length versus sampling time curve or mixed integer linear programming formulation, which checks overlap between two intervals of any collision-time interval pair.

Izvorni jezik
Engleski

Znanstvena područja
Elektrotehnika, Računarstvo, Temeljne tehničke znanosti



POVEZANOST RADA


Projekt / tema
0036-0363078-3018

Ustanove
Fakultet elektrotehnike i računarstva, Zagreb