Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

José M. Mendes Filho

dblp:203/4658 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Robot navigation and mapping · 50% Motion planning and robot control · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › motion planning › multi-robot motion planning
distributed motion planning
0.312017
Real-time distributed receding horizon motion planning and control for mobile multi-robot dynamic systems · ICRA 2017
Robotics › Robot navigation and mapping
multi-robot navigation
0.312017
Real-time distributed receding horizon motion planning and control for mobile multi-robot dynamic systems · ICRA 2017
Mathematical optimization
constrained optimization
0.112017
Real-time distributed receding horizon motion planning and control for mobile multi-robot dynamic systems · ICRA 2017

Methods — techniques the papers use, named apart from their topics

trajectory tracking MPC · 0.6distributed receding horizon · 0.6
YearPublicationVenuePosition
2018 Experimental Validation of a Multirobot Distributed Receding Horizon Motion Planning Approach
abstract
This paper addresses the problem of motion planning for a multirobot system in a partially known environment where conditions such as uncertainty about robots' positions and communication delays are real. In particular, we detail the use of a Distributed Receding Horizon Approach that guarantees collision avoidance with static obstacles and between robots communicating with each other. Underlying optimization problems are solved by using a Sequential Least Squares Programming algorithm. Experiments with real nonholonomic mobile platforms are performed. The proposed framework is compared with the Dynamic Window approach to motion planning in a single robot setup. A second experiment shows results for a multirobot case using two robots where collision is avoided even in presence of significant localization uncertainties.
José M. Mendes Filho, Eric Lucet, David Filliat
ICARCV1
2017 Real-time distributed receding horizon motion planning and control for mobile multi-robot dynamic systems
abstract
This paper proposes an improvement of a motion planning approach and a modified model predictive control (MPC) for solving the navigation problem of a team of dynamical wheeled mobile robots in the presence of obstacles in a realistic environment. Planning is performed by a distributed receding horizon algorithm where constrained optimization problems are numerically solved for each prediction time-horizon. This approach allows distributed motion planning for a multi-robot system with asynchronous communication while avoiding collisions and minimizing the travel time of each robot. However, the robots dynamics prevents the planned motion to be applied directly to the robots. Using unicycle-like vehicles in a dynamic simulation, we show that deviations from the planned motion caused by the robots dynamics can be overcome by modifying the optimization problem underlying the planning algorithm and by adding an MPC for trajectory tracking. Results also indicate that this approach can be used in systems subjected to real-time constraint.
José M. Mendes Filho, Eric Lucet, David Filliat
ICRA1