The era of robotics-based environmental monitoring has given rise to many interesting areas research. A key challenge is that robotic platforms and their operations are typically constrained in ways limit energy, time, or travel distance, which turn limits the number measurements can be collected. Therefore, paths need planned maximize information gathered about an unknown environment while sat...

Learning trajectories for a robot in unknown environments which can be generalized to different types of robots is a challenging problem. The input space is very high dimensional and any type of algorithm and computation has a very high time complexity and challenging to define problems in such a high state space. Applying low-dimensional reduction to such problems does the trick for us. We can...

Path planning has important applications in many areas, for example industrial robotics, autonomous systems, virtual prototyping, and computer-aided drug design. This thesis presents a new framework for developing and evaluating path planning algorithms. The framework is named CoPP (Components for Path Planning). It consists of loosely coupled and reusable components that are useful for buildin...

This paper addresses a problem of a continuous path planning of a redundant manipulator where an end-effector needs to follow a desired path. Based on a geometrical analysis, feasible postures of a self-motion are mapped into an interval so that there will be an angle domain boundary and a redundancy resolution to track the desired path lies within this boundary. To choose a best solution among...

A new path-planning algorithm for a motion simulator based on an industrial robot is introduced and compared with the classical washout filter. The algorithm calculates the path of the simulator cell via the solution of an optimization problem with constraints like the workspace of the simulator or maximum joint angle accelerations. Several test results are presented in order to validate the ne...

In video games and robotics, one often discretizes a continuous 2D environment into regular grid with blocked unblocked cells then finds shortest paths for the agents on resulting graph. Shortest paths, of course, are not necessarily true in environment. this article, we therefore study how much longer path can be than corresponding all grids that tessellate environments. We 5 different vertex ...

aim: level of physical activity as key determinant of healthy lifestyle is less than what isrequired in individuals particularly women. applying theories of behavioral change aboutcomplex behaviors such as physical activity leads to identify effective factors and their relations.the aim of this study was to determine predictors of exercise behavior based on developedtheory of planned behavior w...

This paper presents a novel image space path planning method that takes mechanical constraints into consideration. The aim is to synthesize sub-goal images that can be used as reference inputs for image-based visual servoing systems. Synthesized images are constructed based on screw decompositions represented in a projective space. The projective representation allows image synthesis for threed...