An Optimization Method for Pattern Formation in Dynamic Environment*

Existing methods cannot effectively optimize the pattern formation in the dynamic environment. Therefore, this paper presents algorithms to employ the convex quadratic programming to minimize the distance to obtain the optimal pattern parameters based on the dynamic environment information and the given pattern shape and then plan the collision-free path of each robot to the goal considering a preferred velocity. Simulation results verified the effectiveness of the proposed methodology for scenarios of letter formation.

• Publication year

  2020

• Venue

  2020 IEEE 16th International Conference on Control & Automation (ICCA)

• Publication date

  2020-10-09

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/ICCA51439.2020.9264395
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Simultaneous Optimization of Assignments and Goal Formations for Multiple Robots

  2018cited by this paper
• An adaptive pattern formation approach for swarm robots

  2017cited by this paper
• Image and animation display with multiple mobile robots

  2012cited by this paper
• Reciprocal Velocity Obstacles for real-time multi-agent navigation

  2008cited by this paper
• Aircraft trajectory planning with collision avoidance using mixed integer linear programming

  2002cited by this paper
• The Hungarian method for the assignment problem

  1955cited by this paper
• PATTERN FORMATION IN SWARM ROBOTIC SYSTEMS

  year unknowncited by this paper

• No citing papers are available for this paper.