نتایج جستجو برای: dynamic planning
تعداد نتایج: 594736 فیلتر نتایج به سال:
A path-planning method based on a combination of the static global and the dynamic local pathplanning methods is proposed for robot path planning under a complex environment. There are known static obstacles and unknown dynamic obstacles in any complex environment. The local-path planner dynamically generates a local path using obstacle-motion prediction and a rolling window for dynamic path pl...
Classification of engineering parts is very important activity especially in process planning. It is one of important methods utilised in group technology approach for computer aided process planning. The paper deals with methods of classification. Special attention is given to dynamic methods of part grouping as a new method of classification. The dynamic method especially extended possibility...
In dynamic environment, the path planning of mobile robot is a problem difficult to solve. A path planning method for mobile robot based on genetic algorithm is put forward. This method makes use of real number coding and adaptive function with definite physical meaning in the dynamic environment so as to accelerate real-time calculation and improve calculation precision. The simulation result ...
This paper presents an attempt to devise and develop a domain-independent reasoning system (DIRS) scheme for handling dynamic threats, and uses the scheme for automated route planning of military vehicles in an unstructured environment. Automated route planning is a very important branch in applications of artificial intelligence. In a dynamic unstructured environment, instead of simply using s...
In this article we propose an extension for a path planning method based on the LPN-algorithm to have better performance in a very dynamic environment. The path planning method builds a navigation function that drives the robot toward the goal avoiding the obstacles. The basic method is very fast and efficient for a robot with few degrees of freedom. The proposed extension integrates the obstac...
In a future intelligent factory, a robotic manipulator must work efficiently and safely in a Human-Robot collaborative and dynamic unstructured environment. Autonomous path planning is the most important issue which must be resolved first in the process of improving robotic manipulator intelligence. Among the path-planning methods, the Rapidly Exploring Random Tree (RRT) algorithm based on rand...
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
traditional approaches to AI planning. Planning and executing the resulting plans in a dynamic environment implies a continual approach in which planning and execution are interleaved, uncertainty in the current and projected world state is recognized and handled appropriately, and replanning can be performed when the situation changes or planned actions fail. Furthermore, complex planning and ...
This paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. In non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. To this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید