141 research outputs found
Probabilistic approach to physical object disentangling
Physically disentangling entangled objects from each other is a problem
encountered in waste segregation or in any task that requires disassembly of
structures. Often there are no object models, and, especially with cluttered
irregularly shaped objects, the robot can not create a model of the scene due
to occlusion. One of our key insights is that based on previous sensory input
we are only interested in moving an object out of the disentanglement around
obstacles. That is, we only need to know where the robot can successfully move
in order to plan the disentangling. Due to the uncertainty we integrate
information about blocked movements into a probability map. The map defines the
probability of the robot successfully moving to a specific configuration. Using
as cost the failure probability of a sequence of movements we can then plan and
execute disentangling iteratively. Since our approach circumvents only
previously encountered obstacles, new movements will yield information about
unknown obstacles that block movement until the robot has learned to circumvent
all obstacles and disentangling succeeds. In the experiments, we use a special
probabilistic version of the Rapidly exploring Random Tree (RRT) algorithm for
planning and demonstrate successful disentanglement of objects both in 2-D and
3-D simulation, and, on a KUKA LBR 7-DOF robot. Moreover, our approach
outperforms baseline methods
Perceiving guaranteed collision-free robot trajectories in unknown and unpredictable environments
The dissertation introduces novel approaches for solving a fundamental problem: detecting a collision-free robot trajectory based on sensing in real-world environments that are mostly unknown and unpredictable, i.e., obstacle geometries and their motions are unknown. Such a collision-free trajectory must provide a guarantee of safe robot motion by accounting for robot motion uncertainty and obstacle motion uncertainty. Further, as simultaneous planning and execution of robot motion is required to navigate in such environments, the collision-free trajectory must be detected in real-time.
Two novel concepts: (a) dynamic envelopes and (b) atomic obstacles, are introduced to perceive if a robot at a configuration q, at a future time t, i.e., at a point ? = (q, t) in the robot's configuration-time space (CT space), will be collision-free or not, based on sensor data generated at each sensing moment t, in real-time. A dynamic envelope detects a collision-free region in the CT space in spite of unknown motions of obstacles. Atomic obstacles are used to represent perceived unknown obstacles in the environment at each sensing moment. The robot motion uncertainty is modeled by considering that a robot actually moves in a certain tunnel of a desired trajectory in its CT space. An approach based on dynamic envelopes is presented for detecting if a continuous tunnel of trajectories are guaranteed collision-free in an unpredictable environment, where obstacle motions are unknown. An efficient collision-checker is also developed that can perform fast real-time collision detection between a dynamic envelope and a large number of atomic obstacles in an unknown environment. The effectiveness of these methods is tested for different robots using both simulations and real-world experiments
Trajectory planning for industrial robot using genetic algorithms
En las últimas décadas, debido la importancia de sus aplicaciones, se han propuesto muchas investigaciones sobre la planificación de caminos y trayectorias para los manipuladores, algunos de los ámbitos en los que pueden encontrarse ejemplos de aplicación son; la robótica industrial, sistemas autónomos, creación de prototipos virtuales y diseño de fármacos asistido por ordenador. Por otro lado, los algoritmos evolutivos se han aplicado en muchos campos, lo que motiva el interés del autor por investigar sobre su aplicación a la planificación de caminos y trayectorias en robots industriales.
En este trabajo se ha llevado a cabo una búsqueda exhaustiva de la literatura existente relacionada con la tesis, que ha servido para crear una completa base de datos utilizada para realizar un examen detallado de la evolución histórica desde sus orígenes al estado actual de la técnica y las últimas tendencias.
Esta tesis presenta una nueva metodología que utiliza algoritmos genéticos para desarrollar y evaluar técnicas para la planificación de caminos y trayectorias. El conocimiento de problemas específicos y el conocimiento heurístico se incorporan a la codificación, la evaluación y los operadores genéticos del algoritmo.
Esta metodología introduce nuevos enfoques con el objetivo de resolver el problema de la planificación de caminos y la planificación de trayectorias para sistemas robóticos industriales que operan en entornos 3D con obstáculos estáticos, y que ha llevado a la creación de dos algoritmos (de alguna manera similares, con algunas variaciones), que son capaces de resolver los problemas de planificación mencionados.
El modelado de los obstáculos se ha realizado mediante el uso de combinaciones de objetos geométricos simples (esferas, cilindros, y los planos), de modo que se obtiene un algoritmo eficiente para la prevención de colisiones.
El algoritmo de planificación de caminos se basa en técnicas de
optimización globales, usando algoritmos genéticos para minimizar una función
objetivo considerando restricciones para evitar las colisiones con los obstáculos. El
camino está compuesto de configuraciones adyacentes obtenidas mediante una
técnica de optimización construida con algoritmos genéticos, buscando minimizar
una función multiobjetivo donde intervienen la distancia entre los puntos
significativos de las dos configuraciones adyacentes, así como la distancia desde
los puntos de la configuración actual a la final. El planteamiento del problema
mediante algoritmos genéticos requiere de una modelización acorde al
procedimiento, definiendo los individuos y operadores capaces de proporcionar
soluciones eficientes para el problema.Abu-Dakka, FJM. (2011). Trajectory planning for industrial robot using genetic algorithms [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/10294Palanci
An Analysis Review: Optimal Trajectory for 6-DOF-based Intelligent Controller in Biomedical Application
With technological advancements and the development of robots have begun to be utilized in numerous sectors, including industrial, agricultural, and medical. Optimizing the path planning of robot manipulators is a fundamental aspect of robot research with promising future prospects. The precise robot manipulator tracks can enhance the efficacy of a variety of robot duties, such as workshop operations, crop harvesting, and medical procedures, among others. Trajectory planning for robot manipulators is one of the fundamental robot technologies, and manipulator trajectory accuracy can be enhanced by the design of their controllers. However, the majority of controllers devised up to this point were incapable of effectively resolving the nonlinearity and uncertainty issues of high-degree freedom manipulators in order to overcome these issues and enhance the track performance of high-degree freedom manipulators. Developing practical path-planning algorithms to efficiently complete robot functions in autonomous robotics is critical. In addition, designing a collision-free path in conjunction with the physical limitations of the robot is a very challenging challenge due to the complex environment surrounding the dynamics and kinetics of robots with different degrees of freedom (DoF) and/or multiple arms. The advantages and disadvantages of current robot motion planning methods, incompleteness, scalability, safety, stability, smoothness, accuracy, optimization, and efficiency are examined in this paper
Probabilistic Approach to Physical Object Disentangling
Physically disentangling entangled objects from each other is a problem encountered in waste segregation or in any task that requires disassembly of structures. Often there are no object models, and especially with cluttered irregularly shaped objects, the robot cannot create a model of the scene due to occlusion. One of our key insights is that based on previous sensory input we are only interested in moving an object out of the disentanglement around obstacles. That is, we only need to know where the robot can successfully move in order to plan the disentangling. Due to the uncertainty we integrate information about blocked movements into a probability map. The map defines the probability of the robot successfully moving to a specific configuration. Using as cost the failure probability of a sequence of movements we can then plan and execute disentangling iteratively. Since our approach circumvents only previously encountered obstacles, new movements will yield information about unknown obstacles that block movement until the robot has learned to circumvent all obstacles and disentangling succeeds. In the experiments, we use a special probabilistic version of the Rapidly exploring Random Tree (RRT) algorithm for planning and demonstrate successful disentanglement of objects both in 2-D and 3-D simulation, and, on a KUKA LBR 7-DOF robot. Moreover, our approach outperforms baseline methods
Motion planning in 2D and 3D with rotation
Imperial Users onl
Monte-Carlo Robot Path Planning
Path planning is a crucial algorithmic approach for designing robot
behaviors. Sampling-based approaches, like rapidly exploring random trees
(RRTs) or probabilistic roadmaps, are prominent algorithmic solutions for path
planning problems. Despite its exponential convergence rate, RRT can only find
suboptimal paths. On the other hand, , a widely-used extension
to RRT, guarantees probabilistic completeness for finding optimal paths but
suffers in practice from slow convergence in complex environments. Furthermore,
real-world robotic environments are often partially observable or with poorly
described dynamics, casting the application of in complex
tasks suboptimal. This paper studies a novel algorithmic formulation of the
popular Monte-Carlo tree search (MCTS) algorithm for robot path planning.
Notably, we study Monte-Carlo Path Planning (MCPP) by analyzing and proving, on
the one part, its exponential convergence rate to the optimal path in fully
observable Markov decision processes (MDPs), and on the other part, its
probabilistic completeness for finding feasible paths in partially observable
MDPs (POMDPs) assuming limited distance observability (proof sketch). Our
algorithmic contribution allows us to employ recently proposed variants of MCTS
with different exploration strategies for robot path planning. Our experimental
evaluations in simulated 2D and 3D environments with a 7 degrees of freedom
(DOF) manipulator, as well as in a real-world robot path planning task,
demonstrate the superiority of MCPP in POMDP tasks.Comment: Accepted: RA-L & IROS 202
- …