Design Optimizer for Planar Soft-Growing Robot Manipulators
- URL: http://arxiv.org/abs/2310.03374v2
- Date: Sat, 9 Dec 2023 12:44:03 GMT
- Title: Design Optimizer for Planar Soft-Growing Robot Manipulators
- Authors: Fabio Stroppa
- Abstract summary: This work presents a novel approach for design optimization of soft-growing robots.
I optimize the kinematic chain of a soft manipulator to reach targets and avoid unnecessary overuse of material and resources.
I tested the proposed method on different tasks to access its optimality, which showed significant performance in solving the problem.
- Score: 1.1888144645004388
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Soft-growing robots are innovative devices that feature plant-inspired growth
to navigate environments. Thanks to their embodied intelligence of adapting to
their surroundings and the latest innovation in actuation and manufacturing, it
is possible to employ them for specific manipulation tasks. The applications of
these devices include exploration of delicate/dangerous environments,
manipulation of items, or assistance in domestic environments.
This work presents a novel approach for design optimization of soft-growing
robots, which will be used prior to manufacturing to suggest engineers -- or
robot designer enthusiasts -- the optimal dimension of the robot to be built
for solving a specific task. I modeled the design process as a multi-objective
optimization problem, in which I optimize the kinematic chain of a soft
manipulator to reach targets and avoid unnecessary overuse of material and
resources. The method exploits the advantages of population-based optimization
algorithms, in particular evolutionary algorithms, to transform the problem
from multi-objective into a single-objective thanks to an efficient
mathematical formulation, the novel rank-partitioning algorithm, and obstacle
avoidance integrated within the optimizer operators.
I tested the proposed method on different tasks to access its optimality,
which showed significant performance in solving the problem. Finally,
comparative experiments showed that the proposed method works better than the
one existing in the literature in terms of precision, resource consumption, and
run time.
Related papers
- A 'MAP' to find high-performing soft robot designs: Traversing complex design spaces using MAP-elites and Topology Optimization [5.774729866385869]
There are no widely adopted computational design tools that produce quality, manufacturable designs.
In this work, we investigate a hierarchical design optimization methodology to generate diverse and high-performance soft robots.
Our method provides a new framework to design parts in complex design domains, both soft and rigid.
arXiv Detail & Related papers (2024-07-10T12:27:17Z) - Supercompiler Code Optimization with Zero-Shot Reinforcement Learning [63.164423329052404]
We present CodeZero, an artificial intelligence agent trained extensively on large data to produce effective optimization strategies instantly for each program in a single trial of the agent.
Our methodology kindles the great potential of artificial intelligence for engineering and paves the way for scaling machine learning techniques in the realm of code optimization.
arXiv Detail & Related papers (2024-04-24T09:20:33Z) - Machine Learning Insides OptVerse AI Solver: Design Principles and
Applications [74.67495900436728]
We present a comprehensive study on the integration of machine learning (ML) techniques into Huawei Cloud's OptVerse AI solver.
We showcase our methods for generating complex SAT and MILP instances utilizing generative models that mirror multifaceted structures of real-world problem.
We detail the incorporation of state-of-the-art parameter tuning algorithms which markedly elevate solver performance.
arXiv Detail & Related papers (2024-01-11T15:02:15Z) - Contribution \`a l'Optimisation d'un Comportement Collectif pour un
Groupe de Robots Autonomes [0.0]
This thesis studies the domain of collective robotics, and more particularly the optimization problems of multirobot systems.
The first contribution is the use of the Butterfly Algorithm Optimization (BOA) to solve the Unknown Area Exploration problem.
The second contribution is the development of a new simulation framework for benchmarking dynamic incremental problems in robotics.
arXiv Detail & Related papers (2023-06-10T21:49:08Z) - Evolutionary Solution Adaption for Multi-Objective Metal Cutting Process
Optimization [59.45414406974091]
We introduce a framework for system flexibility that allows us to study the ability of an algorithm to transfer solutions from previous optimization tasks.
We study the flexibility of NSGA-II, which we extend by two variants: 1) varying goals, that optimize solutions for two tasks simultaneously to obtain in-between source solutions expected to be more adaptable, and 2) active-inactive genotype, that accommodates different possibilities that can be activated or deactivated.
Results show that adaption with standard NSGA-II greatly reduces the number of evaluations required for optimization to a target goal, while the proposed variants further improve the adaption costs.
arXiv Detail & Related papers (2023-05-31T12:07:50Z) - Optimal Design of Electric Machine with Efficient Handling of
Constraints and Surrogate Assistance [5.387300498478744]
This article proposes an optimization method incorporated into a popularly-used evolutionary multi-objective optimization algorithm - NSGA-II.
The proposed method exploits the inexpensiveness of geometric constraints to generate feasible designs by using a custom repair operator.
arXiv Detail & Related papers (2022-06-03T17:13:29Z) - Investigating Positive and Negative Qualities of Human-in-the-Loop
Optimization for Designing Interaction Techniques [55.492211642128446]
Designers reportedly struggle with design optimization tasks where they are asked to find a combination of design parameters that maximizes a given set of objectives.
Model-based computational design algorithms assist designers by generating design examples during design.
Black box methods for assistance, on the other hand, can work with any design problem.
arXiv Detail & Related papers (2022-04-15T20:40:43Z) - A distributed, plug-n-play algorithm for multi-robot applications with a
priori non-computable objective functions [2.2452191187045383]
In multi-robot applications, the user-defined objectives of the mission can be cast as a general optimization problem.
Standard gradient-descent-like algorithms are not applicable to these problems.
We introduce a new algorithm that carefully designs each robot's subcost function, the optimization of which can accomplish the overall team objective.
arXiv Detail & Related papers (2021-11-14T20:40:00Z) - Evolutionary Gait Transfer of Multi-Legged Robots in Complex Terrains [14.787379075870383]
This paper proposes a transfer learning-based evolutionary framework for gait optimization, named Tr-GO.
The idea is to initialize a high-quality population by using the technique of transfer learning, so any kind of population-based optimization algorithms can be seamlessly integrated into this framework.
The experimental results show the effectiveness of the proposed framework for the gait optimization problem based on three multi-objective evolutionary algorithms.
arXiv Detail & Related papers (2020-12-24T16:41:36Z) - AI-based Modeling and Data-driven Evaluation for Smart Manufacturing
Processes [56.65379135797867]
We propose a dynamic algorithm for gaining useful insights about semiconductor manufacturing processes.
We elaborate on the utilization of a Genetic Algorithm and Neural Network to propose an intelligent feature selection algorithm.
arXiv Detail & Related papers (2020-08-29T14:57:53Z) - Automatically Learning Compact Quality-aware Surrogates for Optimization
Problems [55.94450542785096]
Solving optimization problems with unknown parameters requires learning a predictive model to predict the values of the unknown parameters and then solving the problem using these values.
Recent work has shown that including the optimization problem as a layer in a complex training model pipeline results in predictions of iteration of unobserved decision making.
We show that we can improve solution quality by learning a low-dimensional surrogate model of a large optimization problem.
arXiv Detail & Related papers (2020-06-18T19:11:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.