Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Approximating robot configuration spaces with few convex sets using clique covers of visibility graphs
Many computations in robotics can be dramatically accelerated if the robot configuration
space is described as a collection of simple sets. For example, recently developed motion …
space is described as a collection of simple sets. For example, recently developed motion …
Constrained bimanual planning with analytic inverse kinematics
In order for a bimanual robot to manipulate an object that is held by both hands, it must
construct motion plans such that the transformation between its end effectors remains fixed …
construct motion plans such that the transformation between its end effectors remains fixed …
Euclidean and non-euclidean trajectory optimization approaches for quadrotor racing
T Fork, F Borrelli - arxiv preprint arxiv:2309.07262, 2023 - arxiv.org
We present two quadrotor raceline optimization approaches which differ in using Euclidean
or non-Euclidean geometry to describe vehicle position. Both approaches use high-fidelity …
or non-Euclidean geometry to describe vehicle position. Both approaches use high-fidelity …
Implicit graph search for planning on graphs of convex sets
Graphs of Convex Sets (GCS) is a recent method for synthesizing smooth trajectories by
decomposing the planning space into convex sets, forming a graph to encode the adjacency …
decomposing the planning space into convex sets, forming a graph to encode the adjacency …
Efficient collision avoidance for autonomous vehicles in polygonal domains
J Fan, N Murgovski, J Liang - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
This research addresses the trajectory planning challenges for autonomous vehicles
navigating obstacles within confined environments. Utilizing numerical optimal control …
navigating obstacles within confined environments. Utilizing numerical optimal control …
Graphs of convex sets with applications to optimal control and motion planning
T Marcucci - 2024 - dspace.mit.edu
This thesis introduces a new class of problems at the interface of combinatorial and convex
optimization. We consider graphs where each vertex is paired with a convex program, and …
optimization. We consider graphs where each vertex is paired with a convex program, and …
Graph Search-Based Path Planning for Automatic Ship Berthing
X Liu, Z Hu, Z Yang, W Zhang - Journal of Marine Science and …, 2024 - mdpi.com
Ship berthing is one of the most challenging operations for crews, involving optimal
trajectory generation and intricate harbor maneuvering at low speed. In this paper, we …
trajectory generation and intricate harbor maneuvering at low speed. In this paper, we …
Invariant Set Planning for Quadrotors: Design, Analysis, Experiments
We propose a motion planner for quadrotor unmanned aerial vehicles (UAVs) implemented
as a graph search over robust positive invariant (PI) sets. We model the positional error …
as a graph search over robust positive invariant (PI) sets. We model the positional error …
Control Design and Motion Planning for Unmanned Aerial Vehicles: A Data-Driven Scheme
Y Huang - 2024 - search.proquest.com
Abstract Unmanned Aerial Vehicles (UAVs), initially developed for military applications,
have now become indispensable tools across various civilian sectors. To accomplish flight …
have now become indispensable tools across various civilian sectors. To accomplish flight …
Spatiotemporal Co-Design Enabling Prioritized Multi-Agent Motion Planning
Y Huang, W He, Y Kantaros… - 2024 IEEE/RSJ …, 2024 - ieeexplore.ieee.org
This paper introduces an innovative planner for prioritized multi-agent motion planning,
employing a sequential integration of spatial and temporal designs. The planner initiates a …
employing a sequential integration of spatial and temporal designs. The planner initiates a …