Hasil untuk "cs.RO"

Menampilkan 20 dari ~124703 hasil · dari arXiv, DOAJ, CrossRef

JSON API
arXiv Open Access 2025
Improvement of Collision Avoidance in Cut-In Maneuvers Using Time-to-Collision Metrics

Jamal Raiyn

This paper proposes a new strategy for collision avoidance system leveraging Time-to-Collision (TTC) metrics for handling cut-in scenarios, which are particularly challenging for autonomous vehicles (AVs). By integrating a deep learning with TTC calculations, the system predicts potential collisions and determines appropriate evasive actions compared to traditional TTC -based approaches.

en cs.RO, cs.AI
arXiv Open Access 2024
Underwater robot guidance, navigation and control in fish net pens

Sveinung Johan Ohrem

Aquaculture robotics is receiving increased attention and is subject to unique challenges and opportunities for research and development. Guidance, navigation and control are all important aspects for realizing aquaculture robotics solutions that can greatly benefit the industry in the future. Sensor technologies, navigation methods, motion planners and state control all have a role to play, and this paper introduces some technologies and methods that are currently being applied in research and industry before providing some examples of challenges that can be targeted in the future.

en cs.RO
arXiv Open Access 2023
Spatial Intelligence of a Self-driving Car and Rule-Based Decision Making

Stanislav Kikot

In this paper we show how rule-based decision making can be combined with traditional motion planning techniques to achieve human-like behavior of a self-driving vehicle in complex traffic situations. We give and discuss examples of decision rules in autonomous driving. We draw on these examples to illustrate that developing techniques for spatial awareness of robots is an exciting activity which deserves more attention from spatial reasoning community that it had received so far.

en cs.RO, cs.AI
arXiv Open Access 2023
A Method for Multi-Robot Asynchronous Trajectory Execution in MoveIt2

Pascal Stoop, Tharaka Ratnayake, Giovanni Toffetti

This work presents an extension to the MoveIt2 planning library supporting asynchronous execution for multi-robot / multi-arm robotic setups. The proposed method introduces a unified way for the execution of both synchronous and asynchronous trajectories by implementing a simple scheduler and guarantees collision-free operation by continuous collision checking while the robots are moving.

en cs.RO
arXiv Open Access 2022
Recognising Known Configurations of Garments For Dual-Arm Robotic Flattening

Li Duan, Gerardo Argon-Camarasa

Robotic deformable-object manipulation is a challenge in the robotic industry because deformable objects have complicated and various object states. Predicting those object states and updating manipulation planning is time-consuming and computationally expensive. In this paper, we propose learning known configurations of garments to allow a robot to recognise garment states and choose a pre-designed manipulation plan for garment flattening.

en cs.RO, cs.CV
arXiv Open Access 2022
Roadmap to Autonomous Surgery -- A Framework to Surgical Autonomy

Amritpal Singh

Robotic surgery has increased the domain of surgeries possible. Several examples of partial surgical automation have been seen in the past decade. We break down the path of automation tasks into features required and provide a checklist that can help reach higher levels of surgical automation. Finally, we discuss the current challenges and advances required to make this happen.

en cs.RO, cs.AI
arXiv Open Access 2021
Lattices of sensors reconsidered when less information is preferred

Yulin Zhang, Dylan A. Shell

To treat sensing limitations (with uncertainty in both conflation of information and noise) we model sensors as covers. This leads to a semilattice organization of abstract sensors that is appropriate even when additional information is problematic (e.g., for tasks involving privacy considerations).

en cs.RO
arXiv Open Access 2020
Switching Model Predictive Control for Online Structural Reformations of a Foldable Quadrotor

Andreas Papadimitriou, George Nikolakopoulos

The aim of this article is the formulation of a switching model predictive control framework for the case of a foldable quadrotor with the ability to retain the overall control quality during online structural reformations. The majority of the related scientific publications consider fixed morphology of the aerial vehicles. Recent advances in mechatronics have brought novel considerations for generalized aerial robotic designs with the ability to alter their morphology in order to adapt to their environment, thus enhancing their capabilities. Simulation results are provided to prove the efficacy of the selected control scheme.

en cs.RO
arXiv Open Access 2020
Collision free motion planning on a wedge of circles

Elif Sensoy

We exhibit an algorithm with continuous instructions for two robots moving without collisions on a track shaped as a wedge of three circles. We show that the topological complexity of the configuration space associated with this problem is 3. The topological complexity is a homotopy invariant that can be thought of as the minimum number of continuous instructions required to describe the movement of the robots between any initial configuration to any final one without collisions. The algorithm presented is optimal in the sense that it requires exactly 3 continuous instructions.

en cs.RO, math.AT
arXiv Open Access 2019
End to end collision avoidance based on optical flow and neural networks

Jan Blumenkamp

Optical flow is believed to play an important role in the agile flight of birds and insects. Even though it is a very simple concept, it is rarely used in computer vision for collision avoidance. This work implements a neural network based collision avoidance which was deployed and evaluated on a solely for this purpose refitted car.

en cs.RO, cs.CV
arXiv Open Access 2017
Decoupled Sampling Based Planning Method for Multiple Autonomous Vehicles

Fatemeh Mohseni, Mahdi Morsali

This paper proposes a sampling based planning algorithm to control autonomous vehicles. We propose an improved Rapidly-exploring Random Tree which includes the definition of K- nearest points and propose a two-stage sampling strategy to adjust RRT in other to perform maneuver while avoiding collision. The simulation results show the success of the algorithm.

en cs.RO
arXiv Open Access 2016
Dynamic analysis of simultaneous adaptation of force, impedance and trajectory

Yanan Li, Etienne Burdet

When carrying out tasks in contact with the environment, humans are found to concurrently adapt force, impedance and trajectory. Here we develop a robotic model of this mechanism in humans and analyse the underlying dynamics. We derive a general adaptive controller for the interaction of a robot with an environment solely characterised by its stiffness and damping, using Lyapunov theory.

en cs.RO
arXiv Open Access 2015
Swing-twist decomposition in Clifford algebra

Przemysław Dobrowolski

The swing-twist decomposition is a standard routine in motion planning for humanoid limbs. In this paper the decomposition formulas are derived and discussed in terms of Clifford algebra. With the decomposition one can express an arbitrary spinor as a product of a twist-free spinor and a swing-free spinor (or vice-versa) in 3-dimensional Euclidean space. It is shown that in the derived decomposition formula the twist factor is a generalized projection of a spinor onto a vector in Clifford algebra. As a practical application of the introduced theory an optimized decomposition algorithm is proposed. It favourably compares to existing swing-twist decomposition implementations.

en cs.RO
arXiv Open Access 2015
On Probabilistic Completeness of Probabilistic Cell Decomposition

Frank Lingelbach

Probabilistic Cell Decomposition (PCD) is a probabilistic path planning method combining the concepts of approximate cell decomposition with probabilistic sampling. It has been shown that the use of lazy evaluation techniques and supervised sampling in important areas result in a high performance path planning method. Even if it was postulated before that PCD is probabilistically complete, we present a detailed proof of probabilistic completeness here for the first time.

en cs.RO
arXiv Open Access 2013
A General, Fast, and Robust Implementation of the Time-Optimal Path Parameterization Algorithm

Quang-Cuong Pham

Finding the Time-Optimal Parameterization of a given Path (TOPP) subject to kinodynamic constraints is an essential component in many robotic theories and applications. The objective of this article is to provide a general, fast and robust implementation of this component. For this, we give a complete solution to the issue of dynamic singularities, which are the main cause of failure in existing implementations. We then present an open-source implementation of the algorithm in C++/Python and demonstrate its robustness and speed in various robotics settings.

arXiv Open Access 2009
Kinematic analysis of a class of analytic planar 3-RPR parallel manipulators

Philippe Wenger, Damien Chablat

A class of analytic planar 3-RPR manipulators is analyzed in this paper. These manipulators have congruent base and moving platforms and the moving platform is rotated of 180 deg about an axis in the plane. The forward kinematics is reduced to the solution of a 3rd-degree polynomial and a quadratic equation in sequence. The singularities are calculated and plotted in the joint space. The second-order singularities (cups points), which play an important role in non-singular change of assembly-mode motions, are also analyzed.

en cs.RO
arXiv Open Access 2007
A Workspace based Classification of 3R Orthogonal Manipulators

Philippe Wenger, Maher Baili, Damien Chablat

A classification of a family of 3-revolute (3R) positioning manipulators is established. This classification is based on the topology of their workspace. The workspace is characterized in a half-cross section by the singular curves of the manipulator. The workspace topology is defined by the number of cusps and nodes that appear on these singular curves. The design parameters space is shown to be partitioned into nine subspaces of distinct workspace topologies. Each separating surface is given as an explicit expression in the DH-parameters.

en cs.RO

Halaman 4 dari 6236