Given a set X of points in the plane, two distinguished points s; t 2 X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t that uses only points in X as vertices and avoids the obstacles in. We present two results: (1) We show that nding such simple paths among arbitrary obstacles is NP-complete. (2) We give a polynomial-time algorithm t...

A stereo vision based vehicle/obstacle detection system has been proposed that generates alarms when vehicles/obstacles are detected in vicinity of near/mid region. Numerous techniques have been applied to detect vehicles/obstacles using a forward facing monocular camera mounted inside a vehicle. This paper presents a methodology for vehicle/obstacle detection using high resolution stereo camer...

The potential fields method for autonomous robot navigation consists essentially in the assignment of an attractive potential to the goal point and a repulsive potential to each of the obstacles in the environment. Several implementations of potential fields for autonomous robot navigation have been reported. The most simple implementation considers a known environment where fixed potentials ca...

The current study showed that visual fixation of obstacles is not required for rapid and adaptive navigation of obstacles. Children and adults wore a wireless, head-mounted eye-tracker during a visual search task in a room cluttered with obstacles. They spontaneously walked, jumped, and ran through the room, stepping up, down, and over obstacles. Both children and adults navigated adaptively wi...

In this paper the authors relate to the robotic systems to avoid the obstacles while positioning end-effectors. A new strategy to on-line collision-avoidance of the redundant robots with obstacles is presented. The strategy allows the use of redundant degrees of freedom such that a manipulator can avoid obstacles while tracking the desired endeffectors trajectory. The strategy is based on the r...

This paper presents an online planner for suboptimal obstacle avoidance. It generates near-shortest paths incrementally by avoiding obstacles optimally one at a time. In known environments, obstacles are avoided in an order determined by a global criterion. In unknown environments, obstacles are avoided as they are detected by on-board sensors. This avoidance strategy is guaranteed to reach the...

many educational institutions have adopted ELearning system or are thinking to adopt it in their educational systems. As a nearly recent system, many do not know the exact meaning of E-Learning, or why should it be used? After using it, will the institution face any problems? And what are the best solutions for these problems? This paper aims to answer all the above questions. In addition, it d...

Few communities can be certain that their food supply is absolutely secure. River valleys show that there are times when a river needs its valley; it may be reasonable to use the valley as farmland if the interval between floods is 1-50 years: it is less reasonable to build houses in it. Similarly, volcanic soil is so fertile that farming the talus slope is profitable between eruptions. These p...

The complexity of exact motion planning algorithms highly depends on the complexity of the robot’s free space, i.e., the set of all collision-free placements of the robot. Theoretically, the complexity of the free space can be very high. In practice, the complexity of the free space tends to be much smaller. We show that, under some realistic assumptions, the complexity of the free space of a r...

This paper presents a discussion of field research by survey of the range of obstacles to the effective implementation of knowledge management strategies in the Australian corporate environment. The paper provides background to the current study, refers to results and to further research possibilities. Previous research in the UK, in Europe, in Australasia and the USA has presented consistent f...