466 research outputs found

    Analysis of Load-Carrying Capacity for Redundant Free-Floating Space Manipulators in Trajectory Tracking Task

    Get PDF
    The aim of this paper is to analyze load-carrying capacity of redundant free-floating space manipulators (FFSM) in trajectory tracking task. Combined with the analysis of influential factors in load-carrying process, evaluation of maximum load-carrying capacity (MLCC) is described as multiconstrained nonlinear programming problem. An efficient algorithm based on repeated line search within discontinuous feasible region is presented to determine MLCC for a given trajectory of the end-effector and corresponding joint path. Then, considering the influence of MLCC caused by different initial configurations for the starting point of given trajectory, a kind of maximum payload initial configuration planning method is proposed by using PSO algorithm. Simulations are performed for a particular trajectory tracking task of the 7-DOF space manipulator, of which MLCC is evaluated quantitatively. By in-depth research of the simulation results, significant gap between the values of MLCC when using different initial configurations is analyzed, and the discontinuity of allowable load-carrying capacity is illustrated. The proposed analytical method can be taken as theoretical foundation of feasibility analysis, trajectory optimization, and optimal control of trajectory tracking task in on-orbit load-carrying operations

    Bio-Inspired Obstacle Avoidance: from Animals to Intelligent Agents

    Get PDF
    A considerable amount of research in the field of modern robotics deals with mobile agents and their autonomous operation in unstructured, dynamic, and unpredictable environments. Designing robust controllers that map sensory input to action in order to avoid obstacles remains a challenging task. Several biological concepts are amenable to autonomous navigation and reactive obstacle avoidance. We present an overview of most noteworthy, elaborated, and interesting biologically-inspired approaches for solving the obstacle avoidance problem. We categorize these approaches into three groups: nature inspired optimization, reinforcement learning, and biorobotics. We emphasize the advantages and highlight potential drawbacks of each approach. We also identify the benefits of using biological principles in artificial intelligence in various research areas

    Tracking control of redundant mobile manipulator: An RNN based metaheuristic approach

    Get PDF
    In this paper, we propose a topology of Recurrent Neural Network (RNN) based on a metaheuristic optimization algorithm for the tracking control of mobile-manipulator while enforcing nonholonomic constraints. Traditional approaches for tracking control of mobile robots usually require the computation of Jacobian-inverse or linearization of its mathematical model. The proposed algorithm uses a nature-inspired optimization approach to directly solve the nonlinear optimization problem without any further transformation. First, we formulate the tracking control as a constrained optimization problem. The optimization problem is formulated on position-level to avoid the computationally expensive Jacobian-inversion. The nonholonomic limitation is ensured by adding equality constraints to the formulated optimization problem. We then present the Beetle Antennae Olfactory Recurrent Neural Network (BAORNN) algorithm to solve the optimization problem efficiently using very few mathematical operations. We present a theoretical analysis of the proposed algorithm and show that its computational cost is linear with respect to the degree of freedoms (DOFs), i.e., O(m). Additionally, we also prove its stability and convergence. Extensive simulation results are prepared using a simulated model of IIWA14, a 7-DOF industrial-manipulator, mounted on a differentially driven cart. Comparison results with particle swarm optimization (PSO) algorithm are also presented to prove the accuracy and numerical efficiency of the proposed controller. The results demonstrate that the proposed algorithm is several times (around 75 in the worst case) faster in execution as compared to PSO, and suitable for real-time implementation. The tracking results for three different trajectories; circular, rectangular, and rhodonea paths are presented

    A modified membrane-inspired algorithm based on particle swarm optimization for mobile robot path planning

    Get PDF
    YesTo solve the multi-objective mobile robot path planning in a dangerous environment with dynamic obstacles, this paper proposes a modified membraneinspired algorithm based on particle swarm optimization (mMPSO), which combines membrane systems with particle swarm optimization. In mMPSO, a dynamic double one-level membrane structure is introduced to arrange the particles with various dimensions and perform the communications between particles in different membranes; a point repair algorithm is presented to change an infeasible path into a feasible path; a smoothness algorithm is proposed to remove the redundant information of a feasible path; inspired by the idea of tightening the fishing line, a moving direction adjustment for each node of a path is introduced to enhance the algorithm performance. Extensive experiments conducted in different environments with three kinds of grid models and five kinds of obstacles show the effectiveness and practicality of mMPSO.National Natural Science Foundation of China (61170016, 61373047), the Program for New Century Excellent Talents in University (NCET-11-0715) and SWJTU supported project (SWJTU12CX008); grant of the Romanian National Authority for Scientific Research, CNCSUEFISCDI, project number PN-II-ID-PCE- 2011-3-0688

    Combining Subgoal Graphs with Reinforcement Learning to Build a Rational Pathfinder

    Full text link
    In this paper, we present a hierarchical path planning framework called SG-RL (subgoal graphs-reinforcement learning), to plan rational paths for agents maneuvering in continuous and uncertain environments. By "rational", we mean (1) efficient path planning to eliminate first-move lags; (2) collision-free and smooth for agents with kinematic constraints satisfied. SG-RL works in a two-level manner. At the first level, SG-RL uses a geometric path-planning method, i.e., Simple Subgoal Graphs (SSG), to efficiently find optimal abstract paths, also called subgoal sequences. At the second level, SG-RL uses an RL method, i.e., Least-Squares Policy Iteration (LSPI), to learn near-optimal motion-planning policies which can generate kinematically feasible and collision-free trajectories between adjacent subgoals. The first advantage of the proposed method is that SSG can solve the limitations of sparse reward and local minima trap for RL agents; thus, LSPI can be used to generate paths in complex environments. The second advantage is that, when the environment changes slightly (i.e., unexpected obstacles appearing), SG-RL does not need to reconstruct subgoal graphs and replan subgoal sequences using SSG, since LSPI can deal with uncertainties by exploiting its generalization ability to handle changes in environments. Simulation experiments in representative scenarios demonstrate that, compared with existing methods, SG-RL can work well on large-scale maps with relatively low action-switching frequencies and shorter path lengths, and SG-RL can deal with small changes in environments. We further demonstrate that the design of reward functions and the types of training environments are important factors for learning feasible policies.Comment: 20 page

    Hierarchical Swarm Robotics

    Get PDF
    Distributed computing is becoming more and more prevalent in engineering today. Swarm robotics is simply an extension of that, not only dividing the computing power, but also the physical capabilities. This project served as a proof of concept investigation into the feasibility and potential effectiveness of a hierarchical swarm topology (HST), which better mimics the organization of many societal structures. This goal was approached by designing a three-tier robotic swarm as well as a specialized abstract coverage algorithm designed to map an unknown area. Experiments were conducted by modifying various parameters of an HST including the number of tiers and robots per tier. Results supported the original hypothesis that by adding robots, overall runtime and individual workload is reduced

    On the dynamics of human locomotion and co-design of lower limb assistive devices

    Get PDF
    Recent developments in lower extremities wearable robotic devices for the assistance and rehabilitation of humans suffering from an impairment have led to several successes in the assistance of people who as a result regained a certain form of locomotive capability. Such devices are conventionally designed to be anthropomorphic. They follow the morphology of the human lower limbs. It has been shown previously that non-anthropomorphic designs can lead to increased comfort and better dynamical properties due to the fact that there is more morphological freedom in the design parameters of such a device. At the same time, exploitation of this freedom is not always intuitive and can be difficult to incorporate. In this work we strive towards a methodology aiding in the design of possible non-anthropomorphic structures for the task of human locomotion assistance by means of simulation and optimization. The simulation of such systems requires state of the art rigid body dynamics, contact dynamics and, importantly, closed loop dynamics. Through the course of our work, we first develop a novel, open and freely available, state of the art framework for the modeling and simulation of general coupled dynamical systems and show how such a framework enables the modeling of systems in a novel way. The resultant simulation environment is suitable for the evaluation of structural designs, with a specific focus on locomotion and wearable robots. To enable open-ended co-design of morphology and control, we employ population-based optimization methods to develop a novel Particle Swarm Optimization derivative specifically designed for the simultaneous optimization of solution structures (such as mechanical designs) as well as their continuous parameters. The optimizations that we aim to perform require large numbers of simulations to accommodate them and we develop another open and general framework to aid in large scale, population based optimizations in multi-user environments. Using the developed tools, we first explore the occurrence and underlying principles of natural human gait and apply our findings to the optimization of a bipedal gait of a humanoid robotic platform. Finally, we apply our developed methods to the co-design of a non-anthropomorphic, lower extremities, wearable robot in simulation, leading to an iterative co-design methodology aiding in the exploration of otherwise hard to realize morphological design

    Trajectory optimization and control of a free-floating two arms humanoid robot

    Get PDF
    An optimization algorithm for planning the motion of a humanoid robot during extravehicular activities is presented in this paper. The algorithm can schedule and plan the movements of the two robotic arms to move the humanoid robot by using the handrails present outside the international space station. The optimization algorithm considers the eventual constraints imposed by the topology of the handrails and calculates the sequence of grasping and non-grasping phases needed to push and pull the robot along the handrails. A low-level controller is also developed and used to track the planned arms and end-effectors trajectories. Numerical simulations assess the applicability of the proposed strategy in three different typical operations that potentially can be performed in an extravehicular activity scenario

    Distributed Control of a Swarm of Autonomous Unmanned Aerial Vehicles

    Get PDF
    With the increasing use of Unmanned Aerial Vehicles (UAV)s military operations, there is a growing need to develop new methods of control and navigation for these vehicles. This investigation proposes the use of an adaptive swarming algorithm that utilizes local state information to influence the overall behavior of each individual agent in the swarm based upon the agent\u27s current position in the battlespace. In order to investigate the ability of this algorithm to control UAVs in a cooperative manner, a swarm architecture is developed that allows for on-line modification of basic rules. Adaptation is achieved by using a set of behavior coefficients that define the weight at which each of four basic rules is asserted in an individual based upon local state information. An Evolutionary Strategy (ES) is employed to create initial metrics of behavior coefficients. Using this technique, three distinct emergent swarm behaviors are evolved, and each behavior is investigated in terms of the ability of the adaptive swarming algorithm to achieve the desired emergent behavior by modifying the simple rules of each agent. Finally, each of the three behaviors is analyzed visually using a graphical representation of the simulation, and numerically, using a set of metrics developed for this investigation
    • …
    corecore