Random paths with curvature
نویسنده
چکیده
The study of random surfaces as a generalization of Brownian motion, led to a renewed interest after the work of A. N. Polyakov[1]. In 1984, A. Billore, D.J. Gross and E. Marinari[2] applied Monte Carlo techniques to the numerical study of free random surfaces defined as a set of a fixed number of triangles embedded in a continuum space. This method, in practice, is a simulation of a microcanonical ensemble of closed random surfaces with an action proportional to the
منابع مشابه
Numerical simulation of random paths with a curvature dependent action
We have performed a numerical simulation of an ensemble of fixed length closed random paths, embedded in R, weighted with an action proportional to both, the length of the path and the curvature. This model can be considered as an one dimensional analog of the theory of crystaline random surfaces. Two different regimes have been identified, namely Brownian paths (small curvature coupling) and r...
متن کاملAnalysis of critical paths in a project network with random fuzzy activity times
Project planning is part of project management, which is relates to the use of schedules such as Gantt charts to plan and subsequently report progress within the project environment. Initially, the project scope is defined and the appropriate methods for completing the project are determined. In this paper a new approach for the critical path analyzing a project network with random fuzzy activi...
متن کاملContinuous - Curvature Path Planning forMultiple
In this article, we consider path planning for car-like robots in a new way, adding a continuous-curvature condition to the paths. As the optimal paths are too complex to be used, we deene a type of continuous-curvature paths inspired of the Dubins' curves. These paths contain at most seven pieces, each piece being either a line segment, a circular arc or a clothoid arc (a clothoid is a curve w...
متن کاملContinuous - Curvature Path Planningfor
| In this paper, we consider path planning for a car-like vehicle. We deene a new problem adding to the classical one a continuous-curvature constraint and a bound on the curvature derivative, so as to reeect the fact that a car-like vehicle can only reorient its front wheels with a nite velocity. As optimal solutions can contain an innnity of pieces, we propose a solution to compute Sub-optima...
متن کاملPlanning sub-optimal and continuous-curvature paths for car-like robots
This paper deals with path planning for car-like robot. Usual planners compute paths made of circular arcs tangentially connected by line segments, as these paths are locally optimal. The drawback of these paths is that their curvature proole is not continuous: to follow them precisely, a vehicle must stop and reorient its directing wheels at each curvature discontinuity (transition segment{ ci...
متن کامل