检索结果-内蒙古大学图书馆

FlowMP: learning Motion Fields for Robot Planning with Conditional Flow Matching

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Nguyen, Khang Le, An T. Pham, Tien Huber, Manfred Peters, Jan Vu, Minh Nhat Learning and Adaptive Robotics Lab University of Texas Arlington United States Intelligent Autonomous Systems Lab TU Darmstadt Germany Cognitive Robotics Lab University of Manchester United Kingdom SAIROL Darmstadt Germany Hessian.AI Darmstadt Germany TU Wien Vienna Austria GmbH Vienna Austria

Prior flow matching methods in robotics have primarily learned velocity fields to morph one distribution of trajectories into another. In this work, we extend flow matching to capture second-order trajectory dynamics, incorporating acceleration effects either explicitly in the model or implicitly through the learning objective. Unlike diffusion models, which rely on a noisy forward process and iterative denoising steps, flow matching trains a continuous transformation (flow) that directly maps a simple prior distribution to the target trajectory distribution without any denoising procedure. By modeling trajectories with second-order dynamics, our approach ensures that generated robot motions are smooth and physically executable, avoiding the jerky or dynamically infeasible trajectories that first-order models might produce. We empirically demonstrate that this second-order conditional flow matching yields superior performance on motion planning benchmarks, achieving smoother trajectories and higher success rates than baseline planners. These findings highlight the advantage of learning acceleration-aware motion fields, as our method outperforms existing motion planning methods in terms of trajectory quality and planning success. Copyright © 2025, The Authors. All rights reserved.

关键词： Trajectories

Augmenting Human Policies using Riemannian Metrics for Human-Robot Shared Control

学校读者我要写书评

暂无评论

Augmenting Human Policies using Riemannian Metrics for Human...

IEEE International Workshop on Robot and Human Communication (ROMAN)

作者： Yoojin Oh Jean-Claude Passy Jim Mainprice Machine Learning and Robotics Lab University of Stuttgart Germany Max Planck Institute for Intelligent Systems Stuttgart Germany Max Planck Institute for Intelligent Systems Tübingen Germany

We present a shared control framework for teleoperation that combines the human and autonomous robot agents operating in different dimension spaces. The shared control problem is an optimization problem to maximize the human’s internal action-value function while guaranteeing that the shared control policy is close to the autonomous robot policy. This results in a state update rule that augments the human controls using the Riemannian metric that emerges from computing the curvature of the robot’s value function to account for any cost terms or constraints that the human operator may neglect when operating a redundant manipulator. In our experiments, we apply Linear Quadratic Regulators to locally approximate the robot policy using a single optimized robot trajectory, thereby preventing the need for an optimization step at each time step to determine the optimal policy. We show preliminary results of reach-and-grasp teleoperation tasks with a simulated human policy and a pilot user study using the VR headset and controllers. However, the mixed user preference ratings and quantitative results show that more investigation is required to prove the efficacy of the proposed paradigm.

关键词：

Keep it Upright: Model Predictive Control for Nonprehensile Object Transportation with Obstacle Avoidance on a Mobile Manipulator

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Heins, Adam Schoellig, Angela P. The Learning Systems and Robotics Lab The Technical University of Munich Germany The University of Toronto Institute for Aerospace Studies Canada The Vector Institute for Artificial Intelligence Canada

We consider a nonprehensile manipulation task in which a mobile manipulator must balance objects on its end effector without grasping them-known as the waiter's problem-and move to a desired location while avoiding static and dynamic obstacles. In contrast to existing approaches, our focus is on fast online planning in response to new and changing environments. Our main contribution is a whole-body constrained model predictive controller (MPC) for a mobile manipulator that balances objects and avoids collisions. Furthermore, we propose planning using the minimum statically-feasible friction coefficients, which provides robustness to frictional uncertainty and other force disturbances while also substantially reducing the compute time required to update the MPC policy. Simulations and hardware experiments on a velocity-controlled mobile manipulator with up to seven balanced objects, stacked objects, and various obstacles show that our approach can handle a variety of conditions that have not been previously demonstrated, with end effector speeds and accelerations up to 2.0 m/s and 7.9 m/s2, respectively. Notably, we demonstrate a projectile avoidance task in which the robot avoids a thrown ball while balancing a tall bottle. Copyright © 2023, The Authors. All rights reserved.

关键词： End effectors

Distilling Motion Planner Augmented Policies into Visual Control Policies for Robot Manipulation 5

学校读者我要写书评

暂无评论

Distilling Motion Planner Augmented Policies into Visual Con...

5th Conference on Robot learning, CoRL 2021

作者： Arthur Liu, I-Chun Uppal, Shagun Sukhatme, Gaurav S. Lim, Joseph J. Englert, Peter Lee, Youngwoon Cognitive Learning for Vision and Robotics Lab University of Southern California United States Robotic Embedded Systems Laboratory University of Southern California United States

learning complex manipulation tasks in realistic, obstructed environments is a challenging problem due to hard exploration in the presence of obstacles and high-dimensional visual observations. Prior work tackles the exploration problem by integrating motion planning and reinforcement learning. However, the motion planner augmented policy requires access to state information, which is often not available in the real-world settings. To this end, we propose to distill a state-based motion planner augmented policy to a visual control policy via (1) visual behavioral cloning to remove the motion planner dependency along with its jittery motion, and (2) vision-based reinforcement learning with the guidance of the smoothed trajectories from the behavioral cloning agent. We evaluate our method on three manipulation tasks in obstructed environments and compare it against various reinforcement learning and imitation learning baselines. The results demonstrate that our framework is highly sample-efficient and outperforms the state-of-the-art algorithms. Moreover, coupled with domain randomization, our policy is capable of zero-shot transfer to unseen environment settings with distractors. Code and videos are available at https://***/mopa-pd. © 2021 Proceedings of Machine learning Research. All rights reserved.

关键词： Motion planning

Probabilistic Spiking Neural Network for Robotic Tactile Continual learning

学校读者我要写书评

暂无评论

Probabilistic Spiking Neural Network for Robotic Tactile Con...

IEEE International Conference on robotics and Automation (ICRA)

作者： Senlin Fang Yiwen Liu Chengliang Liu Jingnan Wang Yuanzhe Su Yupo Zhang Hoiio Kong Zhengkun Yi Xinyu Wu City University of Macau Macau China The Department of Intelligent Systems and Robot Learning Lab ISRL Group SIAT Branch Institute of Artificial Intelligence and Robotics for Society Shenzhen Institute of Advanced Technology Shenzhen

ISBN: (数字)9798350384574

ISBN: (纸本)9798350384581

The sense of touch is essential for robots to perform various daily tasks. Artificial Neural Networks have shown significant promise in advancing robotic tactile learning. However, due to the changing of tactile data distribution as robots encounter new tasks, ANN-based robotic tactile learning suffers from catastrophic forgetting. To solve this problem, we introduce a novel continual learning (CL) framework called the Probabilistic Spiking Neural Network with Variational Continual learning (PSNN-VCL). In this framework, PSNN introduces uncertainty during spike emission and can apply fast Variational Inference by optimizing the uncertainty through backpropagation, which significantly reduces the required model parameters for VCL. We establish a robotic tactile CL benchmark using publicly available datasets to evaluate our method. Experimental results demonstrated that, compared to other CL methods, PSNN-VCL not only achieves superior performance in terms of widely used CL metrics but also achieves at least a 50% reduction in model parameters on the robotic tactile CL benchmark.

关键词： Continuing education Measurement Uncertainty Spiking neural networks learning (artificial intelligence) Benchmark testing Robot sensing systems

AMSwarmX: Safe Swarm Coordination in CompleX Environments via Implicit Non-Convex Decomposition of the Obstacle-Free Space

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Adajania, Vivek K. Zhou, Siqi Singh, Arun Kumar Schoellig, Angela P. The Learning Systems and Robotics Lab The University of Toronto Institute for Aerospace Studies Canada The Technical University of Munich Germany The Vector Institute for Artificial Intelligence The University of Tartu Estonia

Quadrotor motion planning in complex environments leverage the concept of safe flight corridor (SFC) to facilitate static obstacle avoidance. Typically, SFCs are constructed through convex decomposition of the environment’s free space into cuboids, convex polyhedra, or spheres. However, when dealing with a quadrotor swarm, such SFCs can be overly conservative, substantially limiting the available free space for quadrotors to coordinate. This paper presents an Alternating Minimization-based approach that does not require building a conservative free-space approximation. Instead, both static and dynamic collision constraints are treated in a unified manner. Dynamic collisions are handled based on shared position trajectories of the quadrotors. Static obstacle avoidance is coupled with distance queries from the Octomap, providing an implicit non-convex decomposition of free space. As a result, our approach is scalable to arbitrary complex environments. Through extensive comparisons in simulation, we demonstrate a 60% improvement in success rate, an average 1.8× reduction in mission completion time, and an average 23× reduction in per-agent computation time compared to SFC-based approaches. We also experimentally validated our approach using a Crazyflie quadrotor swarm of up to 12 quadrotors in obstacle-rich environments. The code, supplementary materials, and videos are released for reference. © 2023, CC BY.

关键词： Motion planning

AMSwarm: An Alternating Minimization Approach for Safe Motion Planning of Quadrotor Swarms in Cluttered Environments

学校读者我要写书评

暂无评论

AMSwarm: An Alternating Minimization Approach for Safe Motio...

IEEE International Conference on robotics and Automation (ICRA)

作者： Vivek K. Adajania Siqi Zhou Arun Kumar Singh Angela P. Schoellig Learning Systems and Robotics Lab University of Toronto Institute for Aerospace Studies Canada Technical University of Munich Germany Vector Institute for Artificial Intelligence University of Tartu Estonia

This paper presents a scalable online algorithm to generate safe and kinematically feasible trajectories for quadrotor swarms. Existing approaches rely on linearizing Euclidean distance-based collision constraints and on axis-wise decoupling of kinematic constraints to reduce the trajectory optimization problem for each quadrotor to a quadratic program (QP). This conservative approximation often fails to find a solution in cluttered environments. We present a novel alternative that handles collision constraints without linearization and kinematic constraints in their quadratic form while still retaining the QP form. We achieve this by reformulating the constraints in a polar form and applying an Alternating Minimization algorithm to the resulting problem. Through extensive simulation results, we demonstrate that, as compared to Sequential Convex Programming (SCP) baselines, our approach achieves on average, a 72% improvement in success rate, a 36% reduction in mission time, and a 42 times faster per-agent computation time. We also show that collision constraints derived from discrete-time barrier functions (BF) can be incorporated, leading to different safety behaviours without significant computational overhead. Moreover, our optimizer outperforms the state-of-the-art optimal control solver ACADO in handling BF constraints with a 31 times faster per-agent computation time and a 44% reduction in mission time on average. We experimentally validated our approach on a Crazyflie quadrotor swarm of up to 12 quadrotors. The code with supplementary material and video are released for reference.

关键词：

Planning Coordinated Human-Robot Motions with Neural Network Full-Body Prediction Models

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Kratzer, Philipp Toussaint, Marc Mainprice, Jim The Machine Learning and Robotics Lab University of Stuttgart Germany The Humans to Robots Motions Research Group University of Stuttgart Germany The Learning and Intelligent Systems Lab TU Berlin Germany

Numerical optimization has become a popular approach to plan smooth motion trajectories for robots. However, when sharing space with humans, balancing properly safety, comfort and efficiency still remains challenging. This is notably the case because humans adapt their behavior to that of the robot, raising the need for intricate planning and prediction. In this paper, we propose a novel optimization-based motion planning algorithm, which generates robot motions, while simultaneously maximizing the human trajectory likelihood under a data-driven predictive model. Considering planning and prediction together allows us to formulate objective and constraint functions in the joint human-robot state space. Key to the approach are added latent space modifiers to a differentiable human predictive model based on a dedicated recurrent neural network. These modifiers allow to change the human prediction within motion optimization. We empirically evaluate our method using the publicly available MoGaze [1] dataset. Our results indicate that the proposed framework outperforms current baselines for planning handover trajectories and avoiding collisions between a robot and a human. Our experiments demonstrate collaborative motion trajectories, where both, the human prediction and the robot plan, adapt to each other. © 2022, CC BY.

关键词： Forecasting

AMSwarm: An Alternating Minimization Approach for Safe Motion Planning of Quadrotor Swarms in Cluttered Environments

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Adajania, Vivek K. Zhou, Siqi Singh, Arun Kumar Schoellig, Angela P. Learning Systems and Robotics Lab Germany University of Toronto Institute for Aerospace Studies Canada Technical University of Munich Germany Vector Institute for Artificial Intelligence Canada University of Tartu Estonia

This paper presents a scalable online algorithm to generate safe and kinematically feasible trajectories for quadrotor swarms. Existing approaches rely on linearizing Euclidean distance-based collision constraints and on axis-wise decoupling of kinematic constraints to reduce the trajectory optimization problem for each quadrotor to a quadratic program (QP). This conservative approximation often fails to find a solution in cluttered environments. We present a novel alternative that handles collision constraints without linearization and kinematic constraints in their quadratic form while still retaining the QP form. We achieve this by reformulating the constraints in a polar form and applying an Alternating Minimization algorithm to the resulting problem. Through extensive simulation results, we demonstrate that, as compared to Sequential Convex Programming (SCP) baselines, our approach achieves on average a 72% improvement in success rate, a 36% reduction in mission time, and a 42 times faster per-agent computation time. We also show that collision constraints derived from discrete-time barrier functions (BF) can be incorporated, leading to different safety behaviours without significant computational overhead. Moreover, our optimizer outperforms the state-of-the-art optimal control solver ACADO in handling BF constraints with a 31 times faster per-agent computation time and a 44% reduction in mission time on average. We experimentally validated our approach on a Crazyflie quadrotor swarm of up to 12 quadrotors. The code with supplementary material and video are released for reference. © 2023, CC BY.

关键词： Motion planning