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

Muhannad Mujahed

dblp:82/10007 · also Muhannad Mujahad · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2019
—ORCID · none

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

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

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 · 75% Motion planning and robot control · 25%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
collision avoidance
0.312017
The admissible gap (AG) method for reactive collision avoidance · ICRA 2017
Robotics › Robot navigation and mapping
mobile robot navigation
0.312017
The admissible gap (AG) method for reactive collision avoidance · ICRA 2017
Robotics › Robot navigation and mapping
obstacle avoidance
0.312017
The admissible gap (AG) method for reactive collision avoidance · ICRA 2017
Robotics › Robot navigation and mapping › obstacle avoidance
reactive obstacle avoidance
0.312017
The admissible gap (AG) method for reactive collision avoidance · ICRA 2017

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

admissible gap method · 0.3
YearPublicationVenuePosition
2019 An efficient employment of internet of multimedia things in smart and future agriculture
Shadi AlZu'bi, Bilal Hawashin, Muhannad Mujahed, Yaser Jararweh, Brij B. Gupta
Multim. Tools Appl.3
2017 The admissible gap (AG) method for reactive collision avoidance
abstract
This paper presents a new concept, the Admissible Gap, for collision avoidance. An admissible gap AG is defined as the gap that a robot may safely pass through, while obeying the shape and motion constraints. By employing this concept, a new obstacle avoidance approach was developed, improving the navigation performance in unknown cluttered environments. Unlike most state-of-the-art methods, our approach explicitly considers the robot shape and kinematic constraints rather than adapting a method originally designed for a holonomic pointlike robot. Experimental results demonstrated the power of the proposed AG approach. Moreover, a comparison with state-of-the-art methods showed that the AG approach generates more efficient, safer, and smoother trajectories.
Muhannad Mujahed, Bärbel Mertsching
ICRA1
2016 Robust Collision Avoidance for Autonomous Mobile Robots in Unknown Environments
Muhannad Mujahed, Dirk Fischer 0001, Bärbel Mertsching
RoboCup1
2010 Closest Gap based (CG) reactive obstacle avoidance Navigation for highly cluttered environments
abstract
A new reactive collision avoidance approach for mobile robots moving in cluttered and complex environments was developed and implemented. The novelty of this approach lies in the creation of a new method for analyzing openings in front of the robot that highly reduces their number when compared with the Nearness-Diagram Navigation (ND) technique, particularly in complex scenarios. Moreover, the angular width of the chosen (selected) gap with respect to the robot vision is taken into consideration. Consequently, oscillations are alleviated, the computational complexity is reduced and a smoother behavior will be achieved. Our technique adjusts the motion law proposed in the Smooth Nearness-Diagram Navigation (SND) method to generate safer paths for the robot by considering the ratio of threats on its sides and applying stricter deviation against an obstacle as it gets closer to the robot. Hence, the problem of deadlock occurring in narrow corridors, with high threats on one side and low threats on the other, is solved without affecting the smoothness behavior. Simulation and experimental results demonstrate the power of the proposed approach.
Muhannad Mujahed, Dirk Fischer 0001, Bärbel Mertsching, Hussein Jaddu
IROS1