{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:18:43Z","timestamp":1761488323300,"version":"3.41.2"},"reference-count":19,"publisher":"Emerald","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,8,21]]},"abstract":"<jats:sec>\n                  <jats:title>Purpose<\/jats:title>\n                  <jats:p>The purpose of this paper is to propose a novel ant colony optimization (ACO) approach to optimal control. The standard ACO algorithms have proven to be very powerful optimization metaheuristic for combinatorial optimization problems. They have been demonstrated to work well when applied to various nondeterministic polynomial-complete problems, such as the travelling salesman problem. In this paper, ACO is reformulated as a model-free learning algorithm and its properties are discussed.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Design\/methodology\/approach<\/jats:title>\n                  <jats:p>First, it is described how quantizing the state space of a dynamic system introduces stochasticity in the state transitions and transforms the optimal control problem into a stochastic combinatorial optimization problem, motivating the ACO approach. The algorithm is presented and is applied to the time-optimal swing-up and stabilization of an underactuated pendulum. In particular, the effect of different numbers of ants on the performance of the algorithm is studied.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Findings<\/jats:title>\n                  <jats:p>The simulations show that the algorithm finds good control policies reasonably fast. An increasing number of ants results in increasingly better policies. The simulations also show that although the policy converges, the ants keep on exploring the state space thereby capable of adapting to variations in the system dynamics.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Research limitations\/implications<\/jats:title>\n                  <jats:p>This paper introduces a novel ACO approach to optimal control and as such marks the starting point for more research of its properties. In particular, quantization issues must be studied in relation to the performance of the algorithm.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Originality\/value<\/jats:title>\n                  <jats:p>The paper presented is original as it presents the first application of ACO to optimal control problems.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1108\/17563780910982671","type":"journal-article","created":{"date-parts":[[2009,10,5]],"date-time":"2009-10-05T10:45:11Z","timestamp":1254739511000},"page":"414-434","source":"Crossref","is-referenced-by-count":9,"title":["Novel ant colony optimization approach to optimal control"],"prefix":"10.1108","volume":"2","author":[{"given":"Jelmer","family":"Marinus van Ast","sequence":"first","affiliation":[{"name":"Delft Center for Systems and Control, Delft University of Technology, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Babu\u0161ka","sequence":"additional","affiliation":[{"name":"Delft Center for Systems and Control, Delft University of Technology, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"De Schutter","sequence":"additional","affiliation":[{"name":"Delft Center for Systems and Control, Delft University of Technology, Delft, The Netherlands Marine and Transport Technology, Delft University of Technology, Delft, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"issue":"5\/6","key":"2025072819011675900_b1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00170-007-1048-2","article-title":"Using ant colony optimization to solve hybrid flow shop scheduling problems","volume":"35","author":"Alaykran","year":"2007","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"2025072819011675900_b2","unstructured":"\u00c5str\u00f6m, K.J.\n           and Wittenmark, B. (1990), Computer Controlled Systems \u2013 Theory and Design, Prentice-Hall, Englewood Cliffs, NJ."},{"key":"2025072819011675900_b3","unstructured":"Bianchi, L.\n          , Dorigo, M., Gambardella, L.M. and Gutjahr, W.J. (2006), \u201cMetaheuristics in stochastic combinatorial optimization: a survey\u201d, Technical Report 08, IDSIA, Manno."},{"key":"2025072819011675900_b4","doi-asserted-by":"crossref","unstructured":"Birattari, M.\n          , Caro, G.D. and Dorigo, M. (2002), \u201cToward the formal foundation of ant programming\u201d, Proceedings of the International Workshop on Ant Algorithms (ANTS 2002), Belgium, Springer, Brussels, pp. 199-201.","DOI":"10.1007\/3-540-45724-0_16"},{"key":"2025072819011675900_b5","unstructured":"Colorni, A.\n          , Dorigo, M. and Maniezzo, V. (1992), \u201cDistributed optimization by ant colonies\u201d, in Varela, F.J. and Bourgine, P. (Eds), Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, MIT Press, Cambridge, MA, pp. 134-42."},{"issue":"2\/3","key":"2025072819011675900_b6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","article-title":"Ant colony optimization theory: a survey","volume":"344","author":"Dorigo","year":"2005","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"2025072819011675900_b7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: a cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2025072819011675900_b9","doi-asserted-by":"crossref","unstructured":"Dorigo, M.\n           and St\u00fctzle, T. (2004), Ant Colony Optimization, The MIT Press, Cambridge, MA.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"issue":"1","key":"2025072819011675900_b8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"key":"2025072819011675900_b10","unstructured":"Fan, X.\n          , Luo, X., Yi, S., Yang, S. and Zhang, H. (2003), \u201cOptimal path planning for mobile robots based on intensified ant colony optimization algorithm\u201d, Proceedings of the IEEE International Conference on Robotics, Intelligent Systems and Signal Processing (RISSP 2003), Changsha, pp. 131-6."},{"issue":"7\/8","key":"2025072819011675900_b11","first-page":"805","article-title":"Industrial applications of the ant colony optimization algorithm","volume":"31","author":"Fox","year":"2007","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"2025072819011675900_b12","doi-asserted-by":"crossref","unstructured":"Gambardella, L.M.\n           and Dorigo, M. (1995), \u201cAnt-Q: a reinforcement learning approach to the traveling salesman problem\u201d, in Prieditis, A. and Russell, S. (Eds), Machine Learning: Proceedings of the Twelfth International Conference on Machine Learning, Morgan Kaufmann, San Francisco, CA, pp. 252-60.","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"issue":"1\/2","key":"2025072819011675900_b13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00170-007-1203-9","article-title":"Ant colony system for job shop scheduling with time windows","volume":"39","author":"Huang","year":"2008","journal-title":"International Journal of Advanced Manufacturing Technology"},{"issue":"6","key":"2025072819011675900_b14","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1017\/S0263574704001225","article-title":"Pheromone communication in a robot swarm: necrophoric bee behaviour and its replication","volume":"23","author":"Purnamadjaja","year":"2005","journal-title":"Robotica"},{"issue":"5","key":"2025072819011675900_b15","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/TSMCA.2003.817391","article-title":"Ant colony optimization for routing and load-balancing: survey and new directions","volume":"33","author":"Sim","year":"2003","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part A"},{"key":"2025072819011675900_b16","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T.\n           and Hoos, U. (2000), \u201cMAX MIN ant system\u201d, Journal of Future Generation Computer Systems, Vol. 16, pp. 889-914.","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"2025072819011675900_b17","doi-asserted-by":"crossref","unstructured":"Sutton, R.S.\n           and Barto, A.G. (1998), Reinforcement Learning: An Introduction, MIT Press, Cambridge, MA.","DOI":"10.1109\/TNN.1998.712192"},{"key":"2025072819011675900_b18","doi-asserted-by":"crossref","unstructured":"van Ast, J.M.\n          , Babu\u0161ka, R. and De Schutter, B. (2008), \u201cAnt colony optimization for optimal control\u201d, Proceedings of the 2008 Congress on Evolutionary Computation (CEC 2008), Hong Kong, pp. 2040-6.","DOI":"10.1109\/CEC.2008.4631068"},{"issue":"4","key":"2025072819011675900_b19","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1016\/j.adhoc.2008.06.001","article-title":"HOPNET: a hybrid ant colony optimization routing algorithm for mobile ad hoc network","volume":"7","author":"Wang","year":"2009","journal-title":"Ad Hoc Networks"}],"container-title":["International Journal of Intelligent Computing and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17563780910982671","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17563780910982671\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/ijicc\/article-pdf\/2\/3\/414\/892838\/17563780910982671.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ijicc\/article-pdf\/2\/3\/414\/892838\/17563780910982671.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T23:01:25Z","timestamp":1753743685000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ijicc\/article\/2\/3\/414\/133777\/Novel-ant-colony-optimization-approach-to-optimal"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,21]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8,21]]}},"URL":"https:\/\/doi.org\/10.1108\/17563780910982671","relation":{},"ISSN":["1756-378X","1756-3798"],"issn-type":[{"type":"print","value":"1756-378X"},{"type":"electronic","value":"1756-3798"}],"subject":[],"published":{"date-parts":[[2009,8,21]]}}}