In this research, the target user of UniPlanner: Student Academic Planner will be focused on USIM students. It is a system used to help student manage their time. The purpose developing maximize and improve time management students, organize daily life increase effectiveness studies. description problem solved, how works, methodology, tools in development discussed paper. Overall, include with ...

Robotic navigation is the aspect of cognition related to robot robust mobility. It combines perception, some knowledge on environment and a set goal poses reliably control during mission that involves displacement. Vision-based autonomous an instantiation latter discipline where visual perception used represent environment. This article presents vision-based system uses its onboard camera navig...

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 i...

Party planner Forgetmenot merupakan salah satu party yang bergerak di bidang usaha jasa dekorasi. Maraknya dekorasi khususnya menimbulkan permasalahan dihadapi oleh selaku baru untuk ikut bersaing sehat dengan banyaknya kompetitor sejenis memiliki pengalaman dan branding lebih baik. Berdasarkan tersebut maka dilakukan penelitan menganalisis strategi sistem digunakan Forgetmenot. Penelitian meng...

The paper deals with fundamentals of therapy planning in complex dynamic technological systems. Therapy plans (plans, for short) are introduced via several concepts of hierarchical graph structures. There are investigated hierarchically structured families of plans as collections of pin graphs, rooted families of plans, hierarchically structured plans, and plans itself. Emphasis is put on the i...

plan (isd); isd is initial state description let N = ;; The graph openlist = ;; is = make-initial-state(isd); N := N [ fisg; push(is, openlist); loopif there are no more reachable states in the openlist then we are done break; else let s = choose a reachable state from openlist; openlist := openlist fsg; oneof split-state : choose a proposition p and split s into jval(p)j states; remove s from ...

Divide-and-Evolve (DaE) is an original “memeticization” of Evolutionary Computation and Artificial Intelligence Planning. DaE optimizes either the number of actions, or the total cost of actions, or the total makespan, by generating ordered sequences of intermediate goals via artificial evolution. The evolutionary part of DaE is based on the Evolving Objects (EO) library, and can theorically us...