Pith. sign in

REVIEW 3 cited by

MASPA: An efficient strategy for path planning with a tethered marsupial robotics system

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.02141 v3 pith:5Y7SO6K3 submitted 2024-08-04 cs.RO

classification cs.RO
keywords aerialmarsupialgroundplanningtetheralgorithmapproachassume
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A tethered marsupial robotics system comprises three components: an Unmanned Ground Vehicle (UGV), an Unmanned Aerial Vehicle (UAV), and a tether connecting both robots. Marsupial systems are highly beneficial in industry as they extend the UAV's battery life during flight. This paper introduces a novel strategy for a specific path planning problem in marsupial systems, where each of the three components must avoid collisions with ground and aerial obstacles modeled as 3D cuboids. Given an initial configuration in which the UAV is positioned atop the UGV, the goal is to reach an aerial target with the UAV. We assume that the UGV first moves to a position from which the UAV can take off and fly through a vertical plane to reach an aerial target. We propose an approach that discretizes the space to approximate an optimal solution, minimizing the sum of the lengths of the ground and air paths. First, we assume a taut tether and use a novel algorithm that leverages the convexity of the tether and the geometry of obstacles to efficiently determine the locus of feasible take-off points for the UAV. We then apply this result to scenarios that involve loose tethers. The simulation test results show that our approach can solve complex situations in seconds, outperforming a baseline planning algorithm based on RRT* (Rapidly exploring Random Trees).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Collaborative Exploration with a Marsupial Ground-Aerial Robot Team through Task-Driven Map Compression

    cs.RO 2025-09 conditional novelty 6.0 of 10

    A marsupial ground-aerial robot team shares task-compressed latent map codes and achieves roughly 300x bandwidth reduction while coordinating exploration of large spaces.

  2. Computing optimal trajectories for a tethered pursuer

    cs.CG 2025-07 reject novelty 6.0 of 10

    For a drone and ground robot moving along parallel lines with a tether of bounded length, the minimum-turn, minimum-speed, and minimum-length paths for the ground robot can all be found in linear time.

  3. Efficient variable-length hanging tether parameterization for marsupial robot planning in 3D environments

    cs.RO 2025-02 conditional novelty 6.0 of 10

    A parabola-based tether decision problem accelerates UGV-UAV planning by 2 to 25 times in RRT* and about 100 times in trajectory optimization, with feasibility near 97%.

Pith tools