Autonomous Planning for Multiple Aerial Cinematographers
This paper proposes a planning algorithm for autonomous media production with multiple Unmanned Aerial Vehicles (UAVs) in outdoor events. Given filming tasks specified by a media Director, we formulate an optimization problem to maximize the filming time considering battery constraints. As we conjec...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2021-04 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Luis-Evaristo Caraballo Montes-Romero, Ángel José-Miguel Díaz-Báñez Capitán, Jesús Torres-González, Arturo Ollero, Aníbal |
| description | This paper proposes a planning algorithm for autonomous media production with multiple Unmanned Aerial Vehicles (UAVs) in outdoor events. Given filming tasks specified by a media Director, we formulate an optimization problem to maximize the filming time considering battery constraints. As we conjecture that the problem is NP-hard, we consider a discretization version, and propose a graph-based algorithm that can find an optimal solution of the discrete problem for a single UAV in polynomial time. Then, a greedy strategy is applied to solve the problem sequentially for multiple UAVs. We demonstrate that our algorithm is efficient for small teams (3-5 UAVs) and that its performance is close to the optimum. We showcase our system in field experiments carrying out actual media production in an outdoor scenario with multiple UAVs. |
| doi_str_mv | 10.48550/arxiv.2005.07237 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2005_07237</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2404184076</sourcerecordid><originalsourceid>FETCH-LOGICAL-a526-a1ef9ff681f55059ea981e928e77ed6f582eb397e19bf5a42082310f7e0504323</originalsourceid><addsrcrecordid>eNotj09LwzAYh4MgOOY-gCcLnlvfvEma5FiKfwYTPexeMnwzM9qmpq3ot3dunn6Xhx_Pw9gNh0IapeDepe_wVSCAKkCj0BdsgULw3EjEK7YaxwMAYKlRKbFgppqn2McuzmP21rq-D_0-8zFlL3M7haGlrKIUXJvVoafOTXGf3PBBabxml961I63-d8m2jw_b-jnfvD6t62qTO4Vl7jh5631puD-6KUvOGk4WDWlN76VXBmknrCZud145iWBQcPCaQIEUKJbs9nx7ymqGFDqXfpq_vOaUdyTuzsSQ4udM49Qc4pz6o1ODEiQ3EnQpfgEG1FGb</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2404184076</pqid></control><display><type>article</type><title>Autonomous Planning for Multiple Aerial Cinematographers</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Luis-Evaristo Caraballo ; Montes-Romero, Ángel ; José-Miguel Díaz-Báñez ; Capitán, Jesús ; Torres-González, Arturo ; Ollero, Aníbal</creator><creatorcontrib>Luis-Evaristo Caraballo ; Montes-Romero, Ángel ; José-Miguel Díaz-Báñez ; Capitán, Jesús ; Torres-González, Arturo ; Ollero, Aníbal</creatorcontrib><description>This paper proposes a planning algorithm for autonomous media production with multiple Unmanned Aerial Vehicles (UAVs) in outdoor events. Given filming tasks specified by a media Director, we formulate an optimization problem to maximize the filming time considering battery constraints. As we conjecture that the problem is NP-hard, we consider a discretization version, and propose a graph-based algorithm that can find an optimal solution of the discrete problem for a single UAV in polynomial time. Then, a greedy strategy is applied to solve the problem sequentially for multiple UAVs. We demonstrate that our algorithm is efficient for small teams (3-5 UAVs) and that its performance is close to the optimum. We showcase our system in field experiments carrying out actual media production in an outdoor scenario with multiple UAVs.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2005.07237</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Cinematography ; Computer Science - Robotics ; Optimization ; Polynomials ; Unmanned aerial vehicles</subject><ispartof>arXiv.org, 2021-04</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2005.07237$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1109/IROS45743.2020.9341622$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Luis-Evaristo Caraballo</creatorcontrib><creatorcontrib>Montes-Romero, Ángel</creatorcontrib><creatorcontrib>José-Miguel Díaz-Báñez</creatorcontrib><creatorcontrib>Capitán, Jesús</creatorcontrib><creatorcontrib>Torres-González, Arturo</creatorcontrib><creatorcontrib>Ollero, Aníbal</creatorcontrib><title>Autonomous Planning for Multiple Aerial Cinematographers</title><title>arXiv.org</title><description>This paper proposes a planning algorithm for autonomous media production with multiple Unmanned Aerial Vehicles (UAVs) in outdoor events. Given filming tasks specified by a media Director, we formulate an optimization problem to maximize the filming time considering battery constraints. As we conjecture that the problem is NP-hard, we consider a discretization version, and propose a graph-based algorithm that can find an optimal solution of the discrete problem for a single UAV in polynomial time. Then, a greedy strategy is applied to solve the problem sequentially for multiple UAVs. We demonstrate that our algorithm is efficient for small teams (3-5 UAVs) and that its performance is close to the optimum. We showcase our system in field experiments carrying out actual media production in an outdoor scenario with multiple UAVs.</description><subject>Algorithms</subject><subject>Cinematography</subject><subject>Computer Science - Robotics</subject><subject>Optimization</subject><subject>Polynomials</subject><subject>Unmanned aerial vehicles</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj09LwzAYh4MgOOY-gCcLnlvfvEma5FiKfwYTPexeMnwzM9qmpq3ot3dunn6Xhx_Pw9gNh0IapeDepe_wVSCAKkCj0BdsgULw3EjEK7YaxwMAYKlRKbFgppqn2McuzmP21rq-D_0-8zFlL3M7haGlrKIUXJvVoafOTXGf3PBBabxml961I63-d8m2jw_b-jnfvD6t62qTO4Vl7jh5631puD-6KUvOGk4WDWlN76VXBmknrCZud145iWBQcPCaQIEUKJbs9nx7ymqGFDqXfpq_vOaUdyTuzsSQ4udM49Qc4pz6o1ODEiQ3EnQpfgEG1FGb</recordid><startdate>20210408</startdate><enddate>20210408</enddate><creator>Luis-Evaristo Caraballo</creator><creator>Montes-Romero, Ángel</creator><creator>José-Miguel Díaz-Báñez</creator><creator>Capitán, Jesús</creator><creator>Torres-González, Arturo</creator><creator>Ollero, Aníbal</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20210408</creationdate><title>Autonomous Planning for Multiple Aerial Cinematographers</title><author>Luis-Evaristo Caraballo ; Montes-Romero, Ángel ; José-Miguel Díaz-Báñez ; Capitán, Jesús ; Torres-González, Arturo ; Ollero, Aníbal</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a526-a1ef9ff681f55059ea981e928e77ed6f582eb397e19bf5a42082310f7e0504323</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Cinematography</topic><topic>Computer Science - Robotics</topic><topic>Optimization</topic><topic>Polynomials</topic><topic>Unmanned aerial vehicles</topic><toplevel>online_resources</toplevel><creatorcontrib>Luis-Evaristo Caraballo</creatorcontrib><creatorcontrib>Montes-Romero, Ángel</creatorcontrib><creatorcontrib>José-Miguel Díaz-Báñez</creatorcontrib><creatorcontrib>Capitán, Jesús</creatorcontrib><creatorcontrib>Torres-González, Arturo</creatorcontrib><creatorcontrib>Ollero, Aníbal</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Luis-Evaristo Caraballo</au><au>Montes-Romero, Ángel</au><au>José-Miguel Díaz-Báñez</au><au>Capitán, Jesús</au><au>Torres-González, Arturo</au><au>Ollero, Aníbal</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Autonomous Planning for Multiple Aerial Cinematographers</atitle><jtitle>arXiv.org</jtitle><date>2021-04-08</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>This paper proposes a planning algorithm for autonomous media production with multiple Unmanned Aerial Vehicles (UAVs) in outdoor events. Given filming tasks specified by a media Director, we formulate an optimization problem to maximize the filming time considering battery constraints. As we conjecture that the problem is NP-hard, we consider a discretization version, and propose a graph-based algorithm that can find an optimal solution of the discrete problem for a single UAV in polynomial time. Then, a greedy strategy is applied to solve the problem sequentially for multiple UAVs. We demonstrate that our algorithm is efficient for small teams (3-5 UAVs) and that its performance is close to the optimum. We showcase our system in field experiments carrying out actual media production in an outdoor scenario with multiple UAVs.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2005.07237</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2021-04 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2005_07237 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Cinematography Computer Science - Robotics Optimization Polynomials Unmanned aerial vehicles |
| title | Autonomous Planning for Multiple Aerial Cinematographers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T05%3A28%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Autonomous%20Planning%20for%20Multiple%20Aerial%20Cinematographers&rft.jtitle=arXiv.org&rft.au=Luis-Evaristo%20Caraballo&rft.date=2021-04-08&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2005.07237&rft_dat=%3Cproquest_arxiv%3E2404184076%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2404184076&rft_id=info:pmid/&rfr_iscdi=true |