Path planning for multiple mobile robots under double-warehouse (Q506735)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Path planning for multiple mobile robots under double-warehouse |
scientific article; zbMATH DE number 6679913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Path planning for multiple mobile robots under double-warehouse |
scientific article; zbMATH DE number 6679913 |
Statements
Path planning for multiple mobile robots under double-warehouse (English)
0 references
2 February 2017
0 references
multiple mobile robot
0 references
path planning
0 references
double-warehouse
0 references
time-varying nonlinear programming problem
0 references
Con-Per-PSO
0 references
SA-PSO
0 references
0 references
0.7012466192245483
0 references
0.6963725090026855
0 references
0.6935755014419556
0 references
0.6920021176338196
0 references
0.6920020580291748
0 references
