Indoor venues accommodate many people who collectively form crowds. Such crowds in turn influence people's routing choices, e.g., may prefer to avoid crowded rooms when walking from A B. This paper studies two types of crowd-aware indoor path planning queries. The Crowd-Aware Fastest Path Query (FPQ) finds a with the shortest travel time presence crowds, whereas Least Crowded (LCPQ) encounterin...

in present paper, a point to point optimal path is planned for a mobile manipulator with flexible links and joints. for this purpose, a perfect dynamic modeling is performed for mobile manipulators considering large deformation in links, shear effects, elastic joints, effect of gravitation, and non-holonomic constraints. to study large deformation of links, non-linear relation of displacement-s...

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

Industrial robots should be implemented with proper path planning to generate a trajectory which ensures obstacle avoidance and collision free movement. Selection of a path planning techniques need to be done only after detailed studies. This paper deals with the study and implementation of a path planning technique using potential fi eld method for a 2R robot in a given workspace with obstacle...

Substantial automation will be needed to allow operators to control the large teams of robots envisioned for search and rescue, perimeter patrol, and a wide variety of military tasks. Both analysis and research point to navigation and path planning as prime candidates for automation. When operators are isolated from robot navigation, however, there may be loss of situation awareness (SA) and di...

This paper presents a path planning technique for a mobile manipulator whose end-effector path is imposed by a given task. The planning is done decoupling the kinematics of the mobile platform and the manipulator, and planning for the former as a normal mobile robot. Two criteria for planning the path were implemented, one minimizing the need to turn the mobile robot and the other minimizing th...

A path-planning method based on a combination of the static global and the dynamic local pathplanning methods is proposed for robot path planning under a complex environment. There are known static obstacles and unknown dynamic obstacles in any complex environment. The local-path planner dynamically generates a local path using obstacle-motion prediction and a rolling window for dynamic path pl...