Loading…

Calculation of the Shortest Path for Robot to Avoid Obstacles

Obstacle avoidance path was widely used in real life, such as rescue and search, through battle field, robot through obstacles. In this paper, the obstacle avoidance problem of robot was studied. By establishing a mathematical model and considering the speed change of robot when turning, the selecti...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2020-12, Vol.1693 (1), p.12222
Main Authors: Qi, Li-hua, Xing, Dong-qiu, Li, Yan-ni, Cui, Jing-na, Gao, Xin-wei
Format: Article
Language:English
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue 1
container_start_page 12222
container_title Journal of physics. Conference series
container_volume 1693
creator Qi, Li-hua
Xing, Dong-qiu
Li, Yan-ni
Cui, Jing-na
Gao, Xin-wei
description Obstacle avoidance path was widely used in real life, such as rescue and search, through battle field, robot through obstacles. In this paper, the obstacle avoidance problem of robot was studied. By establishing a mathematical model and considering the speed change of robot when turning, the selection principle and calculation of the shortest path for robot to pass through the obstacle area were discussed.
doi_str_mv 10.1088/1742-6596/1693/1/012222
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2624541104</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2624541104</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2742-dc5ac3ee398aa360e2d83b2a24c52e685474b3d8ec6e859ce72523e4f14b3283</originalsourceid><addsrcrecordid>eNqFkF1LwzAUhoMoOKe_wYB3wmy-m154IcVPBhtu9yFNU9ZRl5pkgv_elMpEEDw3CSfPOW94ALjE6AYjKTOcMzITvBAZFgXNcIYwSXUEJoeX48NdylNwFsIWIZoqn4DbUndm3-nYuh10DYwbC1cb56MNES513MDGefjqKhdhdPDuw7U1XFQhatPZcA5OGt0Fe_F9TsH64X5dPs3mi8fn8m4-M2TIrQ3XhlpLC6k1FciSWtKKaMIMJ1ZIznJW0VpaI6zkhbE54YRa1uDUJpJOwdW4tvfufZ9-prZu73cpURFBGGcYI5aofKSMdyF426jet2_afyqM1KBKDRLUIEQNqhRWo6o0eT1Otq7_Wf2yLFe_QdXXTYLpH_B_EV9FaXb5</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2624541104</pqid></control><display><type>article</type><title>Calculation of the Shortest Path for Robot to Avoid Obstacles</title><source>Publicly Available Content Database</source><source>Free Full-Text Journals in Chemistry</source><creator>Qi, Li-hua ; Xing, Dong-qiu ; Li, Yan-ni ; Cui, Jing-na ; Gao, Xin-wei</creator><creatorcontrib>Qi, Li-hua ; Xing, Dong-qiu ; Li, Yan-ni ; Cui, Jing-na ; Gao, Xin-wei</creatorcontrib><description>Obstacle avoidance path was widely used in real life, such as rescue and search, through battle field, robot through obstacles. In this paper, the obstacle avoidance problem of robot was studied. By establishing a mathematical model and considering the speed change of robot when turning, the selection principle and calculation of the shortest path for robot to pass through the obstacle area were discussed.</description><identifier>ISSN: 1742-6588</identifier><identifier>EISSN: 1742-6596</identifier><identifier>DOI: 10.1088/1742-6596/1693/1/012222</identifier><language>eng</language><publisher>Bristol: IOP Publishing</publisher><subject>Obstacle avoidance ; Physics ; Robots</subject><ispartof>Journal of physics. Conference series, 2020-12, Vol.1693 (1), p.12222</ispartof><rights>Published under licence by IOP Publishing Ltd</rights><rights>2020. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2624541104?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,25753,27924,27925,37012,44590</link.rule.ids></links><search><creatorcontrib>Qi, Li-hua</creatorcontrib><creatorcontrib>Xing, Dong-qiu</creatorcontrib><creatorcontrib>Li, Yan-ni</creatorcontrib><creatorcontrib>Cui, Jing-na</creatorcontrib><creatorcontrib>Gao, Xin-wei</creatorcontrib><title>Calculation of the Shortest Path for Robot to Avoid Obstacles</title><title>Journal of physics. Conference series</title><addtitle>J. Phys.: Conf. Ser</addtitle><description>Obstacle avoidance path was widely used in real life, such as rescue and search, through battle field, robot through obstacles. In this paper, the obstacle avoidance problem of robot was studied. By establishing a mathematical model and considering the speed change of robot when turning, the selection principle and calculation of the shortest path for robot to pass through the obstacle area were discussed.</description><subject>Obstacle avoidance</subject><subject>Physics</subject><subject>Robots</subject><issn>1742-6588</issn><issn>1742-6596</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqFkF1LwzAUhoMoOKe_wYB3wmy-m154IcVPBhtu9yFNU9ZRl5pkgv_elMpEEDw3CSfPOW94ALjE6AYjKTOcMzITvBAZFgXNcIYwSXUEJoeX48NdylNwFsIWIZoqn4DbUndm3-nYuh10DYwbC1cb56MNES513MDGefjqKhdhdPDuw7U1XFQhatPZcA5OGt0Fe_F9TsH64X5dPs3mi8fn8m4-M2TIrQ3XhlpLC6k1FciSWtKKaMIMJ1ZIznJW0VpaI6zkhbE54YRa1uDUJpJOwdW4tvfufZ9-prZu73cpURFBGGcYI5aofKSMdyF426jet2_afyqM1KBKDRLUIEQNqhRWo6o0eT1Otq7_Wf2yLFe_QdXXTYLpH_B_EV9FaXb5</recordid><startdate>20201201</startdate><enddate>20201201</enddate><creator>Qi, Li-hua</creator><creator>Xing, Dong-qiu</creator><creator>Li, Yan-ni</creator><creator>Cui, Jing-na</creator><creator>Gao, Xin-wei</creator><general>IOP Publishing</general><scope>O3W</scope><scope>TSCCA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>H8D</scope><scope>HCIFZ</scope><scope>L7M</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20201201</creationdate><title>Calculation of the Shortest Path for Robot to Avoid Obstacles</title><author>Qi, Li-hua ; Xing, Dong-qiu ; Li, Yan-ni ; Cui, Jing-na ; Gao, Xin-wei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2742-dc5ac3ee398aa360e2d83b2a24c52e685474b3d8ec6e859ce72523e4f14b3283</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Obstacle avoidance</topic><topic>Physics</topic><topic>Robots</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Qi, Li-hua</creatorcontrib><creatorcontrib>Xing, Dong-qiu</creatorcontrib><creatorcontrib>Li, Yan-ni</creatorcontrib><creatorcontrib>Cui, Jing-na</creatorcontrib><creatorcontrib>Gao, Xin-wei</creatorcontrib><collection>IOP Publishing (Open access)</collection><collection>IOPscience (Open Access)</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Aerospace Database</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</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><jtitle>Journal of physics. Conference series</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Qi, Li-hua</au><au>Xing, Dong-qiu</au><au>Li, Yan-ni</au><au>Cui, Jing-na</au><au>Gao, Xin-wei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Calculation of the Shortest Path for Robot to Avoid Obstacles</atitle><jtitle>Journal of physics. Conference series</jtitle><addtitle>J. Phys.: Conf. Ser</addtitle><date>2020-12-01</date><risdate>2020</risdate><volume>1693</volume><issue>1</issue><spage>12222</spage><pages>12222-</pages><issn>1742-6588</issn><eissn>1742-6596</eissn><abstract>Obstacle avoidance path was widely used in real life, such as rescue and search, through battle field, robot through obstacles. In this paper, the obstacle avoidance problem of robot was studied. By establishing a mathematical model and considering the speed change of robot when turning, the selection principle and calculation of the shortest path for robot to pass through the obstacle area were discussed.</abstract><cop>Bristol</cop><pub>IOP Publishing</pub><doi>10.1088/1742-6596/1693/1/012222</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1742-6588
ispartof Journal of physics. Conference series, 2020-12, Vol.1693 (1), p.12222
issn 1742-6588
1742-6596
language eng
recordid cdi_proquest_journals_2624541104
source Publicly Available Content Database; Free Full-Text Journals in Chemistry
subjects Obstacle avoidance
Physics
Robots
title Calculation of the Shortest Path for Robot to Avoid Obstacles
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T20%3A08%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Calculation%20of%20the%20Shortest%20Path%20for%20Robot%20to%20Avoid%20Obstacles&rft.jtitle=Journal%20of%20physics.%20Conference%20series&rft.au=Qi,%20Li-hua&rft.date=2020-12-01&rft.volume=1693&rft.issue=1&rft.spage=12222&rft.pages=12222-&rft.issn=1742-6588&rft.eissn=1742-6596&rft_id=info:doi/10.1088/1742-6596/1693/1/012222&rft_dat=%3Cproquest_cross%3E2624541104%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2742-dc5ac3ee398aa360e2d83b2a24c52e685474b3d8ec6e859ce72523e4f14b3283%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2624541104&rft_id=info:pmid/&rfr_iscdi=true