Path planning for multiple mobile robots under double-warehouse

DOI10.1016/j.ins.2014.03.058zbMath1354.68271OpenAlexW2012872133MaRDI QIDQ506735

Yong Ma, Min Guo, Yong Xie, Hongwei Wang

Publication date: 2 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.03.058

zbMATH Keywords

path planningCon-Per-PSOdouble-warehousemultiple mobile robotSA-PSOtime-varying nonlinear programming problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Artificial intelligence for robotics (68T40)

Related Items (2)

Multi-goal motion planning using traveling salesman problem in belief space ⋮ Coordinated fuzzy control of robotic arms with actuator nonlinearities and motion constraints

Uses Software

• NSIPS

Cites Work

• Unnamed Item
• A case study of the collision-avoidance problem based on Bernstein-Bézier path tracking for multiple robots with known constraints
• A novel algorithm for solving optimal path planning problems based on parametrization method and fuzzy aggregation
• On multiple moving objects
• On the problem of multiple mobile robots cluttering a workspace
• Robot trajectory planning with semi-infinite programming.
• A novel approach for multiple mobile objects path planning: parametrization method and conflict resolution strategy
• Intelligent mobile manipulator navigation using adaptive neuro-fuzzy systems
• Motion planning in the presence of moving obstacles

This page was built for publication: Path planning for multiple mobile robots under double-warehouse