Maram Alajlan

  • Citations Per Year
Learn More
Global path planning is considered as a fundamental problem for mobile robots. In this paper, we investigate the capabilities of genetic algorithms (GA) for solving the global path planning problem in large-scale grid maps. First, we propose a GA approach for efficiently finding an (or near) optimal path in the grid map. We carefully designed GA operators(More)
Although there exist efficient methods to determine an optimal path in a graph, such as Dijkstra and A* algorithms, large instances of the path planning problemneed more adequate and efficient techniques to obtain solutions in reasonable time. We propose two new time-linear relaxed versions of Dijkstra (RD) and A* (RA*) algorithms to solve the global path(More)
Building distributed applications for cooperative service robots systems is a very challenging task from software engineering perspective. Indeed, apart from the complexity of designing software components for the control of a single autonomous robot, cooperative multi-robot systems require additional care in the design of software components to ensure(More)
  • 1