Scholarlink

<p>During the use of robotics in applications such as antiterrorism or combat, a motion-constrained pursuer vehicle, such as a Dubins unmanned surface vehicle (USV), must get close enough (within a prescribed zero or positive distance) to a moving target as quickly as possible, resulting in the extended minimum-time intercept problem (EMTIP). Existing research has primarily focused on the zero-distance intercept problem, MTIP, establishing the necessary or sufficient conditions for MTIP optimality, and utilizing analytic algorithms, such as root-finding algorithms, to calculate the optimal solutions. However, these approaches depend heavily on the properties of the analytic algorithm, making them inapplicable when problem settings change, such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion. In this study, an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program (QG-PWL) is proposed for the EMTIP. This program can accommodate different effective interception ranges and complicated target motions (variable velocity or complicated trajectories). The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies. The approximate error in the intercept path length is proved to be bounded to <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(h^{2}/(4\sqrt 2)\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <msup> <mi>h</mi> <mrow> <mn>2</mn> </mrow> </msup> <mrow> <mo>/</mo> </mrow> <mo stretchy="false">(</mo> <mn>4</mn> <msqrt> <mn>2</mn> </msqrt> <mo stretchy="false">)</mo> </math></EquationSource> </InlineEquation>, where <i>h</i> is the piecewise length.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Quality-guaranteed Dubins Path Planning for USV Based on Mixed-integer Piecewise-linear Programming for Addressing the Extended Minimum-time Intercept Problem

  • 期刊论文

  • 发表日期：

    2025年11月24日

查看全文
  • Xing Zhou,
  • Kelin Zhu,
  • Shuang Liu,
  • Zhaoqing Li,
  • Wenxin Zhang,
  • Kang Du

摘要

During the use of robotics in applications such as antiterrorism or combat, a motion-constrained pursuer vehicle, such as a Dubins unmanned surface vehicle (USV), must get close enough (within a prescribed zero or positive distance) to a moving target as quickly as possible, resulting in the extended minimum-time intercept problem (EMTIP). Existing research has primarily focused on the zero-distance intercept problem, MTIP, establishing the necessary or sufficient conditions for MTIP optimality, and utilizing analytic algorithms, such as root-finding algorithms, to calculate the optimal solutions. However, these approaches depend heavily on the properties of the analytic algorithm, making them inapplicable when problem settings change, such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion. In this study, an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program (QG-PWL) is proposed for the EMTIP. This program can accommodate different effective interception ranges and complicated target motions (variable velocity or complicated trajectories). The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies. The approximate error in the intercept path length is proved to be bounded to \(h^{2}/(4\sqrt 2)\) h 2 / ( 4 2 ) , where h is the piecewise length.