نتایج جستجو برای: exploring random trees
تعداد نتایج: 469733 فیلتر نتایج به سال:
The paper proposes a simulation-based method for the validation of continuous and hybrid systems, which is built upon the RRT algorithm (Rapidly-exploring Random Trees). We propose a coverage measure, defined as the star discrepancy of the explored points, and use it to guide the simulation process towards the behaviors of interest.
Rapidly-exploring Random Trees are planning algorithms recently introduced for a broad class of path planning problems. In this paper we provide three different ways to better the performance of such algorithms. Numerical results obtained implementing them over a parallel system outline an optimal speed up.
To plan a feasible path in the environment with danger zones for assembly/disassembly, a RRT-based path planning algorithm was presented. The algorithm addressed a new density avoided sampling function based on kurtosis coefficient for planning in the free configuration space, and introduced a random sampling function which obtains random state from the triangles that describe the danger zones....
one of the most visible aspects of a forest stand structure is the spatial patterns of trees. competition affects on forest structure and its understanding is important, when the purpose of forest management is to imitate the dynamic of natural ecosystems. for this purpose, an unmanaged intact forest was selected with 26 hectares area. all chestnut leaf oak (quercus castaneifolia) trees with a ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید