Wyniki wyszukiwania - BazTech

1

On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus

Eberbach Eugene

Fundamenta Informaticae

|

2022

|

Vol. 188 nr 2

63--90

EN

In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete (Diagonalization complete) and H-complete (Hypercomputation complete) classes. In the paper, in the spirit of Cook/Levin/Karp, we started the population process of these new classes assigning several undecidable problems to them. We justify that some super-Turing models of computation, i.e., models going beyond Turing machines, are tremendously expressive and they allow to accept arbitrary languages over a given alphabet including those undecidable ones. We prove also that one of such super-Turing models of computation - the $-Calculus, designed as a tool for automatic problem solving and automatic programming, has also such tremendous expressiveness. We investigate also completeness of cost metrics and meta-search algorithms in $-calculus.

2

Automatic programming and generation of collision-free paths for the Mitsubishi Movemaster RV-M1 robot

Foit K., Kost G. G., Reclik D.

Journal of Achievements in Materials and Manufacturing Engineering

|

2011

|

Vol. 47, nr 1

57--65

EN

Purpose: of this paper: This paper discuss the possibility to develop and implementing the computer system, which could be able to generate a collision-free path and prepare the data for direct implementing in the robot’s program. Design/methodology/approach: The existing methods of planning of the collision-free paths are mainly limited to the 2D issue and implemented for the mobile robots. The existing methods for planning the trajectory in 3D are often complicated and time-consuming, so most of them are not introduced in reality, being only a theory. In the paper the 2½D method has been presented together with the method of smoothing the generated trajectory. Experiments have been carried out in the virtual environment as well as on the real robot. Findings: The developed PLANER application has been adapted for cooperation with the Mitsubishi Movemaster RV-M1 robot. The current tests, together with the previous one carried out on the Fanuc RJ3iB robot, have shown the versatility of the method and the possibility to adapt it for cooperation with any robotic system. Research limitations/implications: The further stage of research will be concentrated on the consolidation of trajectory generating and simulation phase with the program execution stage in such a way, that the determination of collision-free path could be realized in real time. Practical implications: This approach clearly simplifies the stage of defining the relevant points of the trajectory in order to avoid collisions with the technological objects located in the robot’s manipulator environment. Thereby it significantly reduces the time needed for implementation of the program to the production cycle. Originality/value: The method of generating the collision-free trajectories, which is described in the paper, combines some of the existing tools with the new approach to achieve the optimal performance of the algorithm.

3

Automatic Programming System with Access in The Natural Language

Kazimierczak J.

Studia Informatica : systems and information technology

|

2005

|

Vol. 2(6)

35--47

EN

In this paper, acquisition of knowledge from user's programs written in Pascal to the knowledge base of the computer is introduced. It is shown that system with such a kind of knowledge can be used as the automatic programming system. First, representation of knowledge acquired by the computer from different programs is characterized. Then searching for pieces of knowledge in the knowledge base needed for synthesis of a program specified in user requirement is described. Finally, the construction of a new program from the found pieces of knowledge is shown.

4

Eliminating Introns in Ant Colony Programming

Boryczka M.

Fundamenta Informaticae

|

2005

|

Vol. 68, nr 1/2

1--19

EN

Ant Colony Programming is a relatively new paradigm based on Genetic Programming and Ant Colony System. We discuss the problem of eliminating introns in Ant Colony Programming. The approach is tested on several approximation problems. The test results demonstrate that the proposed method simplifies significantly the achieved solutions and shortens their evaluation time.