Path planning for multiple mobile robots under double-warehouse

•Path planning problems under double-warehouse are modeled scientifically.•Model characteristics are illustrated in detail.•Approach with improved PSO is proposed.•Approach fits for multi-robot paths planning under double-warehouse. This work investigates the conflict-free path planning problems for...

Celý popis

Podrobná bibliografia

Vydané v:	Information sciences Ročník 278; s. 357 - 379
Hlavní autori:	Ma, Yong, Wang, Hongwei, Xie, Yong, Guo, Min
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 10.09.2014
Predmet:	Con-Per-PSO Double-warehouse Multiple mobile robot Path planning SA-PSO Time-varying nonlinear programming problem Time-varying nonlinear programming problem Path planning Double-warehouse Multiple mobile robot Con-Per-PSO SA-PSO
ISSN:	0020-0255, 1872-6291
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!