Contribution \`a l'Optimisation d'un Comportement Collectif pour un
Groupe de Robots Autonomes
- URL: http://arxiv.org/abs/2306.06527v1
- Date: Sat, 10 Jun 2023 21:49:08 GMT
- Title: Contribution \`a l'Optimisation d'un Comportement Collectif pour un
Groupe de Robots Autonomes
- Authors: Amine Bendahmane
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This thesis studies the domain of collective robotics, and more particularly
the optimization problems of multirobot systems in the context of exploration,
path planning and coordination. It includes two contributions. The first one is
the use of the Butterfly Optimization Algorithm (BOA) to solve the Unknown Area
Exploration problem with energy constraints in dynamic environments. This
algorithm was never used for solving robotics problems before, as far as we
know. We proposed a new version of this algorithm called xBOA based on the
crossover operator to improve the diversity of the candidate solutions and
speed up the convergence of the algorithm. The second contribution is the
development of a new simulation framework for benchmarking dynamic incremental
problems in robotics such as exploration tasks. The framework is made in such a
manner to be generic to quickly compare different metaheuristics with minimum
modifications, and to adapt easily to single and multi-robot scenarios. Also,
it provides researchers with tools to automate their experiments and generate
visuals, which will allow them to focus on more important tasks such as
modeling new algorithms. We conducted a series of experiments that showed
promising results and allowed us to validate our approach and model.
Related papers
- Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search [61.08720171136229]
We present a novel algorithm, SMART, for the problem based on a hybridization of three innovative techniques.
Two of these techniques are based on dynamic programming, where we show a powerful connection between the coalitions selected for evaluation and the performance of the algorithms.
Our techniques bring a new way of approaching the problem and a new level of precision to the field.
arXiv Detail & Related papers (2024-07-22T23:24:03Z) - Multiobjective Evolutionary Component Effect on Algorithm behavior [0.04588028371034406]
It is unknown what are the most influential components that lead to performance improvements.
We apply this methodology to a tuned Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) designed by the iterated racing (irace) configuration package.
We compare the impact of the algorithm components in terms of their Search Trajectory Networks (STNs), the diversity of the population, and the anytime hypervolume values.
arXiv Detail & Related papers (2023-07-31T16:02:56Z) - Leveraging Sequentiality in Reinforcement Learning from a Single
Demonstration [68.94506047556412]
We propose to leverage a sequential bias to learn control policies for complex robotic tasks using a single demonstration.
We show that DCIL-II can solve with unprecedented sample efficiency some challenging simulated tasks such as humanoid locomotion and stand-up.
arXiv Detail & Related papers (2022-11-09T10:28:40Z) - On the Convergence of Distributed Stochastic Bilevel Optimization
Algorithms over a Network [55.56019538079826]
Bilevel optimization has been applied to a wide variety of machine learning models.
Most existing algorithms restrict their single-machine setting so that they are incapable of handling distributed data.
We develop novel decentralized bilevel optimization algorithms based on a gradient tracking communication mechanism and two different gradients.
arXiv Detail & Related papers (2022-06-30T05:29:52Z) - 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) - An Overview and Experimental Study of Learning-based Optimization
Algorithms for Vehicle Routing Problem [49.04543375851723]
Vehicle routing problem (VRP) is a typical discrete optimization problem.
Many studies consider learning-based optimization algorithms to solve VRP.
This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.
arXiv Detail & Related papers (2021-07-15T02:13:03Z) - Robotic Brain Storm Optimization: A Multi-target Collaborative Searching
Paradigm for Swarm Robotics [24.38312890501329]
This paper proposes a BSO-based collaborative searching framework for swarm robotics called Robotic BSO.
The proposed method can simulate the BSO's guided search characteristics and has an excellent prospect for multi-target searching problems for swarm robotics.
arXiv Detail & Related papers (2021-05-27T13:05:48Z) - Machine Learning Framework for Quantum Sampling of Highly-Constrained,
Continuous Optimization Problems [101.18253437732933]
We develop a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate unconstrained binary optimization problems.
We showcase the framework's performance on two inverse design problems by optimizing thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering.
arXiv Detail & Related papers (2021-05-06T02:22:23Z) - A User's Guide to Calibrating Robotics Simulators [54.85241102329546]
This paper proposes a set of benchmarks and a framework for the study of various algorithms aimed to transfer models and policies learnt in simulation to the real world.
We conduct experiments on a wide range of well known simulated environments to characterize and offer insights into the performance of different algorithms.
Our analysis can be useful for practitioners working in this area and can help make informed choices about the behavior and main properties of sim-to-real algorithms.
arXiv Detail & Related papers (2020-11-17T22:24:26Z) - Predicting Sample Collision with Neural Networks [5.713670854553366]
We present a framework to address the cost of expensive primitive operations in sampling-based motion planning.
We evaluate our framework on multiple planning problems with a variety of robots in 2D and 3D workspaces.
arXiv Detail & Related papers (2020-06-30T14:56:14Z) - New Fusion Algorithm provides an alternative approach to Robotic Path
planning [0.0]
This paper presents a new and efficient fusion algorithm for solving the path planning problem in a custom 2D environment.
The new fusion algorithm is feasible and superior in smoothness performance and can satisfy as a time-efficient and cheaper alternative to conventional A* strategies of path planning.
arXiv Detail & Related papers (2020-06-06T17:52:00Z)
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.