IDEAS home Printed from https://ideas.repec.org/a/hin/complx/1579865.html
   My bibliography  Save this article

Distributed Constraint Optimization with Flocking Behavior

Author

Listed:
  • Zhengquan Yang
  • Qing Zhang
  • Zengqiang Chen

Abstract

This paper studies distributed optimization having flocking behavior and local constraint set. Multiagent systems with continuous-time and second-order dynamics are studied. Each agent has a local constraint set and a local objective function, which are known to only one agent. The objective is for multiple agents to optimize a sum of the local functions with local interaction and information. First, a bounded potential function to construct the controller is given and a distributed optimization algorithm that makes a group of agents avoid collisions during the evolution is presented. Then, it is proved that all agents track the optimal velocity while avoiding collisions. The proof of the main result is divided into three steps: global set convergence, consensus analysis, and optimal set convergence. Finally, a simulation is included to illustrate the results.

Suggested Citation

  • Zhengquan Yang & Qing Zhang & Zengqiang Chen, 2018. "Distributed Constraint Optimization with Flocking Behavior," Complexity, Hindawi, vol. 2018, pages 1-8, December.
    • Handle: RePEc:hin:complx:1579865
    DOI: 10.1155/2018/1579865
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2018/1579865.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2018/1579865.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/1579865?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Jueyou Li & Chuanye Gu & Zhiyou Wu & Changzhi Wu, 2017. "Distributed Optimization Methods for Nonconvex Problems with Inequality Constraints over Time-Varying Networks," Complexity, Hindawi, vol. 2017, pages 1-10, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      Statistics

      Access and download statistics

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:1579865. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.