895 research outputs found

    Keep Rollin' - Whole-Body Motion Control and Planning for Wheeled Quadrupedal Robots

    Full text link
    We show dynamic locomotion strategies for wheeled quadrupedal robots, which combine the advantages of both walking and driving. The developed optimization framework tightly integrates the additional degrees of freedom introduced by the wheels. Our approach relies on a zero-moment point based motion optimization which continuously updates reference trajectories. The reference motions are tracked by a hierarchical whole-body controller which computes optimal generalized accelerations and contact forces by solving a sequence of prioritized tasks including the nonholonomic rolling constraints. Our approach has been tested on ANYmal, a quadrupedal robot that is fully torque-controlled including the non-steerable wheels attached to its legs. We conducted experiments on flat and inclined terrains as well as over steps, whereby we show that integrating the wheels into the motion control and planning framework results in intuitive motion trajectories, which enable more robust and dynamic locomotion compared to other wheeled-legged robots. Moreover, with a speed of 4 m/s and a reduction of the cost of transport by 83 % we prove the superiority of wheeled-legged robots compared to their legged counterparts.Comment: IEEE Robotics and Automation Letter

    Design and modeling of a stair climber smart mobile robot (MSRox)

    Full text link

    Virtual Structure Based Formation Tracking of Multiple Wheeled Mobile Robots: An Optimization Perspective

    Get PDF
    Today, with the increasing development of science and technology, many systems need to be optimized to find the optimal solution of the system. this kind of problem is also called optimization problem. Especially in the formation problem of multi-wheeled mobile robots, the optimization algorithm can help us to find the optimal solution of the formation problem. In this paper, the formation problem of multi-wheeled mobile robots is studied from the point of view of optimization. In order to reduce the complexity of the formation problem, we first put the robots with the same requirements into a group. Then, by using the virtual structure method, the formation problem is reduced to a virtual WMR trajectory tracking problem with placeholders, which describes the expected position of each WMR formation. By using placeholders, you can get the desired track for each WMR. In addition, in order to avoid the collision between multiple WMR in the group, we add an attraction to the trajectory tracking method. Because MWMR in the same team have different attractions, collisions can be easily avoided. Through simulation analysis, it is proved that the optimization model is reasonable and correct. In the last part, the limitations of this model and corresponding suggestions are given

    Sensor Network Based Collision-Free Navigation and Map Building for Mobile Robots

    Full text link
    Safe robot navigation is a fundamental research field for autonomous robots including ground mobile robots and flying robots. The primary objective of a safe robot navigation algorithm is to guide an autonomous robot from its initial position to a target or along a desired path with obstacle avoidance. With the development of information technology and sensor technology, the implementations combining robotics with sensor network are focused on in the recent researches. One of the relevant implementations is the sensor network based robot navigation. Moreover, another important navigation problem of robotics is safe area search and map building. In this report, a global collision-free path planning algorithm for ground mobile robots in dynamic environments is presented firstly. Considering the advantages of sensor network, the presented path planning algorithm is developed to a sensor network based navigation algorithm for ground mobile robots. The 2D range finder sensor network is used in the presented method to detect static and dynamic obstacles. The sensor network can guide each ground mobile robot in the detected safe area to the target. Furthermore, the presented navigation algorithm is extended into 3D environments. With the measurements of the sensor network, any flying robot in the workspace is navigated by the presented algorithm from the initial position to the target. Moreover, in this report, another navigation problem, safe area search and map building for ground mobile robot, is studied and two algorithms are presented. In the first presented method, we consider a ground mobile robot equipped with a 2D range finder sensor searching a bounded 2D area without any collision and building a complete 2D map of the area. Furthermore, the first presented map building algorithm is extended to another algorithm for 3D map building

    Comprehensive review on controller for leader-follower robotic system

    Get PDF
    985-1007This paper presents a comprehensive review of the leader-follower robotics system. The aim of this paper is to find and elaborate on the current trends in the swarm robotic system, leader-follower, and multi-agent system. Another part of this review will focus on finding the trend of controller utilized by previous researchers in the leader-follower system. The controller that is commonly applied by the researchers is mostly adaptive and non-linear controllers. The paper also explores the subject of study or system used during the research which normally employs multi-robot, multi-agent, space flying, reconfigurable system, multi-legs system or unmanned system. Another aspect of this paper concentrates on the topology employed by the researchers when they conducted simulation or experimental studies

    Mobile Robotics, Moving Intelligence

    Get PDF

    Smart element aware gate controller for intelligent wheeled robot navigation

    Get PDF
    The directing of a wheeled robot in an unknown moving environment with physical barriers is a difficult proposition. In particular, having an optimal or near-optimal path that avoids obstacles is a major challenge. In this paper, a modified neuro-controller mechanism is proposed for controlling the movement of an indoor mobile robot. The proposed mechanism is based on the design of a modified Elman neural network (MENN) with an effective element aware gate (MEEG) as the neuro-controller. This controller is updated to overcome the rigid and dynamic barriers in the indoor area. The proposed controller is implemented with a mobile robot known as Khepera IV in a practical manner. The practical results demonstrate that the proposed mechanism is very efficient in terms of providing shortest distance to reach the goal with maximum velocity as compared with the MENN. Specifically, the MEEG is better than MENN in minimizing the error rate by 58.33%

    Application of Odometry and Dijkstra Algorithm as Navigation and Shortest Path Determination System of Warehouse Mobile Robot

    Get PDF
    One of the technologies in the industrial world that utilizes robots is the delivery of goods in warehouses, especially in the goods distribution process. This is very useful, especially in terms of resource efficiency and reducing human error. The existing system in this process usually uses the line follower concept on the robot's path with a camera sensor to determine the destination location. If the line and destination are not detected by the sensor or camera, the robot's navigation system will experience an error. it can happen if the sensor is dirty or the track is faded. The aim of this research is to develop a robot navigation system for efficient goods delivery in warehouses by integrating odometry and Dijkstra's algorithm for path planning. Holonomic robot is a robot that moves freely without changing direction to produce motion with high mobility. Dijkstra's algorithm is added to the holonomic robot to obtain the fastest trajectory. by calculating the distance of the node that has not been passed from the initial position, if in the calculation the algorithm finds a shorter distance it will be stored as a new route replacing the previously recorded route. the distance traversed by the djikstra algorithm is 780 mm while a distance of 1100 mm obtains the other routes. The time for using the Djikstra method is proven to be 5.3 seconds faster than the track without the Djikstra method with the same speed. Uneven track terrain can result in a shift in the robot's position so that it can affect the travel data. The conclusion is that odometry and Dijkstra's algorithm as a planning system and finding the shortest path are very efficient for warehouse robots to deliver goods than ordinary line followers without Dijkstra, both in terms of distance and travel time
    corecore