A Quantum Planner for Robot Motion

نویسندگان

چکیده

The possibility of integrating quantum computation in a traditional system appears to be viable route drastically improve the performance systems endowed with artificial intelligence. An example such processing consists implementing teleo-reactive employing computing. In this work, we considered navigation robot an environment where its decisions are drawn from algorithm. particular, behavior is formalized through production system. It used describe world, actions it can perform, and conditions robot’s behavior. According rules, planning activities processed recognize–act cycle rule Such aims achieve significant computational speed-up.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generic Motion Planner for Robot Multi-fingered Manipulation

This paper addresses the dexterous manipulation-planning problem, which deals with motion planning for multi-fingered hand manipulating objects among static obstacles, under quasi-static movement assumption. We propose a general manipulation approach capable to compute object and finger trajectories as well as the finger relocation sequence, in order to link any two given configurations of the ...

متن کامل

Generic Motion Planner for Robot Multi-fingered Manipulation

This paper addresses the dexterous manipulation-planning problem, which deals with motion planning for multi-fingered hand manipulating objects among static obstacles, under quasi-static movement assumption. We propose a general manipulation approach capable to compute object and finger trajectories as well as the finger relocation sequence, in order to link any two given configurations of the ...

متن کامل

Toward an exact incremental geometric robot motion planner

In this paper we introduce a new class of geometric robot motion planning problems that we call incremental problems. W e also introduce the concept of incremental algorithms to solve this class of problems. As a n example, we describe an incremental critical curve based exact cell decomposition algorithm for a line segment robot moving freely amidst polpgonal obstacles. In the example, after c...

متن کامل

A Motion Planner for Maintaining Landmark Visibility with a Differential Drive Robot

This work studies the interaction of the nonholonomic and visibility constraints of a robot that has to maintain visibility of a static landmark. The robot is a differential drive system and has a sensor with limited field of view. We determine the necessary and sufficient conditions for the existence of a path for our system to be able to maintain landmark visibility in the presence of obstacl...

متن کامل

A Motion Planner for Multiple Mobile Robots

We describe an algorithm for planning the motions of several mobile robots which share the same workspace. Each robot is capable of independent translational motion in two dimensions, and the workspace contains polygonal obstacles. The algorithm computes a path for each robot which avoids all obstacles in the workspace as well as the other robots. It is guaranteed to nd a solution if one exists...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2022

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math10142475