As of August 2024, International Journal "Notes on Intuitionistic Fuzzy Sets" is being indexed in Scopus.
Please check our Instructions to Authors and send your manuscripts to nifs.journal@gmail.com. Next issue: September/October 2024.

Open Call for Papers: International Workshop on Intuitionistic Fuzzy Sets • 13 December 2024 • Banska Bystrica, Slovakia/ online (hybrid mode).
Deadline for submissions: 16 November 2024.

Issue:Generalized net model of neuro-dynamic programming algorithm: Difference between revisions

From Ifigenia, the wiki for intuitionistic fuzzy sets and generalized nets
Jump to navigation Jump to search
 
mNo edit summary
 
Line 1: Line 1:
[[Category:Publications on generalized nets in industry|{{PAGENAME}}]]
[[Category:Publications on generalized nets|{{PAGENAME}}]]
[[Category:Publications on generalized nets|{{PAGENAME}}]]
[[Category:Publications in 2012 year|{{PAGENAME}}]]
[[Category:Publications in 2012 year|{{PAGENAME}}]]

Latest revision as of 15:08, 5 November 2013

shortcut
http://ifigenia.org/wiki/issue:iwgn-12-17-26
Title of paper: Generalized net model of neuro-dynamic programming algorithm
Author(s):
Tatiana Ilkova
Bioinformatics and Mathematical Modelling Department, Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences
tanja@neftochim.bg
Olympia Roeva
Bioinformatics and Mathematical Modelling Department, Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences
olympia@neftochim.bg
Mitko Petrov
Bioinformatics and Mathematical Modelling Department, Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences
mpetrov@biomed.bas.bg
Juris Vanags
Laboratory of Bioengineering, Latvian State Institute of Wood Chemistry, Riga, Latvia
btc@edi.lv
Presented at: 12th IWGN, Burgas, 17 June 2012
Published in: Conference proceedings, pages 17—26
Download:  PDF (73  Kb, File info)
Abstract: The apparatus of generalized nets (GN) is applied here to describe the algorithm of neuro-dynamic programming (NDP). NDP was an alternative to alleviate the “curse of dimensionality” of the Dynamic programming (DP). The traditional approach for solving the Bellman’s equation involves gridding of the state space, solving the optimization for each grid point, as well as performing the stagewise optimization until convergence is reached. The comprehensive sampling of state space can be avoided by identifying the relevant regions of the state space though simulation under judiciously chosen suboptimal policies, which is presented using NDP methods. The proposed method is particularly simple to implement and can be applied for on-line optimization.
Keywords: Generalized nets, Neuro-dynamic algorithm
AMS Classification: 68Q85, 90C39.
References:
  1. Atanassov, K. Generalized Nets and Systems Theory, “Prof. M. Drinov” Academic Publishing House, Sofia, 1997.
  2. Atanassov, K. Generalized Nets, World Scientific, Singapore, 1991.
  3. Atanassov, K. On Generalized Nets Theory, “Prof. Marin Drinov” Academic Publishing House, Sofia, 2007.
  4. Atanassov, K., H. Aladjov, Generalized Nets in Artificial Intelligence. Vol. 2: Generalized Nets and Machine Learning, “Prof. Marin Drinov” Academic Publishing House, Sofia, 2000.
  5. Aladjov, H., K. Atanassov, A generalized net for genetic algorithms learning, Proc. of the XXX Spring Conf. of the Union of Bulgarian Mathematicians, Borovets, Bulgaria, April 8–11 2001, 242–248.
  6. Roeva, O., T. Pencheva, Generalized net model of Brevibacterium flavul 22LD fermentation process, Int. J. Bioautomation, Vol. 2, 2005, 17–23.
  7. Bertsekas, D., J. Tsitsiklis, Neuro-dynamic Programming (1st ed.), Athena Scientific, Belmont, MA, 1996.
  8. Driessens, K., S. Dzeroski, Integrating guidance intro relational reinforcement learning, Mach. Learn., Vol. 57, 2004, 217–304.
  9. Barto, A. G., S. J. Bradtke, S. P. Singh, Real-time learning and control using asynchronous dynamic programming, Technical Report (TR-91-57), Amherst, MA, 1991.
  10. Sutton, R. S. Learning to predict by the methods of temporal Differences, Mach. Learn., Vol. 3, 1988, 9–44.
  11. Kaisare, N. S., J. M. Lee, J. H. Lee, Simulation based strategy for nonlinear optimal control: Application to a microbial cell reactor, Internat. J. Robust Nonlinear Control, Vol. 13, 2003, 347–363.
  12. Soni, A. A Multi-scale Approach to Fed-batch Bioreactor Control, University of Pittsburgh Press, PA, 2002.
  13. Vlachos, D. G., A. B. Mhadeshwar, N. S. Kaisare, Hierarchical multiscale model-based design of experiments, catalysts and reactors for fuel processing, Computer & Chemical Engineering, Vol. 30, 2006, 1712–1724.
  14. Lee, J. M., N. S. Kaisare, J. H. Lee, Choice of approximator and design of penalty function for an approximate dynamic programming based control approach, J. Process. Contr., Vol. 16, 2006, 135–156.
  15. Ilkova, T. Using of dynamic and rollout Neuro-dynamic programming for static and dynamic optimization of a fed-batch fermentation process, Int. J. Bioautomation, Vol. 3, 2005, 29–35.
  16. Ilkova, T., St. Tzonkov, Optimal control of a fed-batch Fermentation process by Neuro-dynamic programming, Int. J. Bioautomation, Vol. 1, 2004, 57–66.
  17. Xiong, Zh., J. Zhang, Neural network model-based on-line re-optimisation control of fed-batch processes using a modified iterative dynamic programming algorithm, Chem. Eng. Process., Vol. 44, 2005, 477–484.
  18. Lee, J. M., J. H. Lee. An approximate dynamic programming approach based approach to dual adaptive control, J. Process. Contr., Vol. 19, 2009, 859–864.
  19. Tosukhowong, T., J. H. Lee, Approximate dynamic programming based optimal control applied to an integrated plant with a reactor and a distillation column with recycle, AIChE J., Vol. 55, 2009, 919–930.
Citations:

The list of publications, citing this article may be empty or incomplete. If you can provide relevant data, please, write on the talk page.