An efficient path planning algorithm, for multi degrees of freedom manipulator robots in dynamic environments, is presented in this paper. The proposed method is based on a local planner and a boundary following method for rapid solution finding. The local planner is replaced by the boundary following method whenever the robot gets stuck in a local minimum. This method was limited to 2-DoF mobi...

In this paper, we propose a computational trajectory generation algorithm for swarm mobile robots using local information in a dynamic environment. The algorithm plans a reference path based on constrained convex nonlinear optimization which avoids both static and dynamic obstacles. This algorithm is combined with one-step-ahead predictive control for a swarm of mobile robots to track the gener...

cable driven parallel manipulator (cdpm) is a special class of parallel manipulator in which the rigid extensible links are replaced by actuated cables. it is necessary to take into consideration the cable dynamics, i.e.; its mass, flexibility and curved shape for manipulating a long-span cdpm. these terms complicate governing equation of motion in a way that special tactic are applied for simu...

Live-cell assays are used to study the dynamic functional cellular processes in High-Content Screening (HCA) of drug discovery processes or in computational biology experiments. The large amount of image data created during the screening requires automatic image-analysis procedures that can describe these dynamic processes. One class of tasks in this application is the tracking of cells. We des...

To find an optimal path for robots in an environment that is only partially known and continuously changing is a difficult problem. This paper presents a new method for generating a collision-free near-optimal path for an autonomous mobile robot in a dynamic environment containing moving and static obstacles using neural network and fuzzy logic with genetic algorithm. The mobile robot selects a...

Mobile robots are vital for automation industries, surveillance and mapping, hazardous operation like nuclear plants, landmine detection etc. The path of such robots is controlled by a navigational algorithm. Several algorithm have been proposed and tried out for navigation of an autonomous mobile robot (AMR) around the globe .Some of these determine the path which is feasible to reach the dest...

A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...

It is well known that A algorithm reduces the search space in many applications. For shortest path computations, the algorithm uses a heuristic estimator which can better guide the search to the destination. It allocates memory dynamically to store only the necessary vertices, which are those vertices in its open list and close list. Therefore, an A algorithm for the shortest paths search probl...

Current DijJServ architecture lacks mechanisms for network path discovery with specific service performance. It is recommended in RFC 2990 [I] that an admission control function be defined which can determine whether to admit a service differentiated flow along the nominated network path, This paper proposes Fair Intelligent Congestion Control over DijJServ (FICC-DS) for addressing this issue. ...

Location fingerprinting is a widely used technique for indoor localization. Traditional fingerprinting methods are generally in point-type, where the received signal strength indicators (RSSI) at discrete points are trained in the offline phase and used as reference in the online phase. This type of radio map requires many human efforts to calibrate and does not take into account the spatial re...