B-tree search reinforcement learning for model based intelligent agent

S. Bhuvaneswari; R. Vignashwaran

doi:10.1117/12.2021162

14 March 2013 B-tree search reinforcement learning for model based intelligent agent

S. Bhuvaneswari, R. Vignashwaran

Proceedings Volume 8768, International Conference on Graphic and Image Processing (ICGIP 2012); 87686F (2013) https://doi.org/10.1117/12.2021162
Event: 2012 International Conference on Graphic and Image Processing, 2012, Singapore, Singapore

Abstract

Agents trained by learning techniques provide a powerful approximation of active solutions for naive approaches. In this study using B – Trees implying reinforced learning the data search for information retrieval is moderated to achieve accuracy with minimum search time. The impact of variables and tactics applied in training are determined using reinforcement learning. Agents based on these techniques perform satisfactory baseline and act as finite agents based on the predetermined model against competitors from the course.

Citation Download Citation

S. Bhuvaneswari and R. Vignashwaran "B-tree search reinforcement learning for model based intelligent agent", Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87686F (14 March 2013); https://doi.org/10.1117/12.2021162

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available