Loading…

Higher-order optimal deployment with self-triggered coordination

This paper studies a k-order coverage control problem where a network of agents must deploy themselves over a desired area. The objective is to deploy all the agents in a decentralized manner such that the coverage performance of the network is maximized. Unlike many prior works that consider multi-...

Full description

Saved in:
Bibliographic Details
Main Authors: Tabatabai, Daniel, Nowzari, Cameron
Format: Conference Proceeding
Language:English
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 2715
container_issue
container_start_page 2710
container_title
container_volume
creator Tabatabai, Daniel
Nowzari, Cameron
description This paper studies a k-order coverage control problem where a network of agents must deploy themselves over a desired area. The objective is to deploy all the agents in a decentralized manner such that the coverage performance of the network is maximized. Unlike many prior works that consider multi-agent deployment, we explicitly consider applications where more than one agent may be required to service an event that occurs in the domain. The proposed method ensures that the agents move to an optimal configuration while simultaneously relaxing the requirement of constant communication among the agents. In order to achieve the stated goals, a self-triggered coordination method is developed that both determines how agents should move without having to continuously acquire information from other agents, as well as when to acquire new information. Simulation results illustrate that the self-triggered algorithm reduces the amount of communication necessary to accomplish the deployment task while not having to sacrifice performance in meeting the goal.
doi_str_mv 10.23919/ACC.2019.8815078
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8815078</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8815078</ieee_id><sourcerecordid>8815078</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-6a550e0c8873050d47b4e8cbb320da0a0518ce28dad357c27964e2c8338c30a73</originalsourceid><addsrcrecordid>eNotj1FLwzAUhaMgOOd-gPjSP5B5kzTNzZuj6CYMfNHnkSZ3XaRrSxqQ_XsL7umch4-Pcxh7ErCWygr7sqnrtQRh14hCg8EbtrJmrgorY6WRt2whlUGusRL37GGafmCmbQUL9rqL7YkSH1KgVAxjjmfXFYHGbricqc_Fb8ynYqLuyHOKbUuJQuGHGY-9y3HoH9nd0XUTra65ZN_vb1_1ju8_tx_1Zs-jMDrzymkNBB7RKNAQStOUhL5plITgwIEW6ElicEFp46WxVUnSo1LoFTijluz53xuJ6DCmeWe6HK6H1R81CEnS</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Higher-order optimal deployment with self-triggered coordination</title><source>IEEE Xplore All Conference Series</source><creator>Tabatabai, Daniel ; Nowzari, Cameron</creator><creatorcontrib>Tabatabai, Daniel ; Nowzari, Cameron</creatorcontrib><description>This paper studies a k-order coverage control problem where a network of agents must deploy themselves over a desired area. The objective is to deploy all the agents in a decentralized manner such that the coverage performance of the network is maximized. Unlike many prior works that consider multi-agent deployment, we explicitly consider applications where more than one agent may be required to service an event that occurs in the domain. The proposed method ensures that the agents move to an optimal configuration while simultaneously relaxing the requirement of constant communication among the agents. In order to achieve the stated goals, a self-triggered coordination method is developed that both determines how agents should move without having to continuously acquire information from other agents, as well as when to acquire new information. Simulation results illustrate that the self-triggered algorithm reduces the amount of communication necessary to accomplish the deployment task while not having to sacrifice performance in meeting the goal.</description><identifier>EISSN: 2378-5861</identifier><identifier>EISBN: 9781538679272</identifier><identifier>EISBN: 1538679264</identifier><identifier>EISBN: 9781538679265</identifier><identifier>EISBN: 1538679272</identifier><identifier>DOI: 10.23919/ACC.2019.8815078</identifier><language>eng</language><publisher>American Automatic Control Council</publisher><ispartof>2019 American Control Conference (ACC), 2019, p.2710-2715</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8815078$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,27902,54530,54907</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8815078$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Tabatabai, Daniel</creatorcontrib><creatorcontrib>Nowzari, Cameron</creatorcontrib><title>Higher-order optimal deployment with self-triggered coordination</title><title>2019 American Control Conference (ACC)</title><addtitle>ACC</addtitle><description>This paper studies a k-order coverage control problem where a network of agents must deploy themselves over a desired area. The objective is to deploy all the agents in a decentralized manner such that the coverage performance of the network is maximized. Unlike many prior works that consider multi-agent deployment, we explicitly consider applications where more than one agent may be required to service an event that occurs in the domain. The proposed method ensures that the agents move to an optimal configuration while simultaneously relaxing the requirement of constant communication among the agents. In order to achieve the stated goals, a self-triggered coordination method is developed that both determines how agents should move without having to continuously acquire information from other agents, as well as when to acquire new information. Simulation results illustrate that the self-triggered algorithm reduces the amount of communication necessary to accomplish the deployment task while not having to sacrifice performance in meeting the goal.</description><issn>2378-5861</issn><isbn>9781538679272</isbn><isbn>1538679264</isbn><isbn>9781538679265</isbn><isbn>1538679272</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2019</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj1FLwzAUhaMgOOd-gPjSP5B5kzTNzZuj6CYMfNHnkSZ3XaRrSxqQ_XsL7umch4-Pcxh7ErCWygr7sqnrtQRh14hCg8EbtrJmrgorY6WRt2whlUGusRL37GGafmCmbQUL9rqL7YkSH1KgVAxjjmfXFYHGbricqc_Fb8ynYqLuyHOKbUuJQuGHGY-9y3HoH9nd0XUTra65ZN_vb1_1ju8_tx_1Zs-jMDrzymkNBB7RKNAQStOUhL5plITgwIEW6ElicEFp46WxVUnSo1LoFTijluz53xuJ6DCmeWe6HK6H1R81CEnS</recordid><startdate>201907</startdate><enddate>201907</enddate><creator>Tabatabai, Daniel</creator><creator>Nowzari, Cameron</creator><general>American Automatic Control Council</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201907</creationdate><title>Higher-order optimal deployment with self-triggered coordination</title><author>Tabatabai, Daniel ; Nowzari, Cameron</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-6a550e0c8873050d47b4e8cbb320da0a0518ce28dad357c27964e2c8338c30a73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2019</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Tabatabai, Daniel</creatorcontrib><creatorcontrib>Nowzari, Cameron</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Tabatabai, Daniel</au><au>Nowzari, Cameron</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Higher-order optimal deployment with self-triggered coordination</atitle><btitle>2019 American Control Conference (ACC)</btitle><stitle>ACC</stitle><date>2019-07</date><risdate>2019</risdate><spage>2710</spage><epage>2715</epage><pages>2710-2715</pages><eissn>2378-5861</eissn><eisbn>9781538679272</eisbn><eisbn>1538679264</eisbn><eisbn>9781538679265</eisbn><eisbn>1538679272</eisbn><abstract>This paper studies a k-order coverage control problem where a network of agents must deploy themselves over a desired area. The objective is to deploy all the agents in a decentralized manner such that the coverage performance of the network is maximized. Unlike many prior works that consider multi-agent deployment, we explicitly consider applications where more than one agent may be required to service an event that occurs in the domain. The proposed method ensures that the agents move to an optimal configuration while simultaneously relaxing the requirement of constant communication among the agents. In order to achieve the stated goals, a self-triggered coordination method is developed that both determines how agents should move without having to continuously acquire information from other agents, as well as when to acquire new information. Simulation results illustrate that the self-triggered algorithm reduces the amount of communication necessary to accomplish the deployment task while not having to sacrifice performance in meeting the goal.</abstract><pub>American Automatic Control Council</pub><doi>10.23919/ACC.2019.8815078</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2378-5861
ispartof 2019 American Control Conference (ACC), 2019, p.2710-2715
issn 2378-5861
language eng
recordid cdi_ieee_primary_8815078
source IEEE Xplore All Conference Series
title Higher-order optimal deployment with self-triggered coordination
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T22%3A30%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Higher-order%20optimal%20deployment%20with%20self-triggered%20coordination&rft.btitle=2019%20American%20Control%20Conference%20(ACC)&rft.au=Tabatabai,%20Daniel&rft.date=2019-07&rft.spage=2710&rft.epage=2715&rft.pages=2710-2715&rft.eissn=2378-5861&rft_id=info:doi/10.23919/ACC.2019.8815078&rft.eisbn=9781538679272&rft.eisbn_list=1538679264&rft.eisbn_list=9781538679265&rft.eisbn_list=1538679272&rft_dat=%3Cieee_CHZPO%3E8815078%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-6a550e0c8873050d47b4e8cbb320da0a0518ce28dad357c27964e2c8338c30a73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8815078&rfr_iscdi=true