@article{MTMT:3168016, title = {The Multi-Agent Planning Problem}, url = {https://m2.mtmt.hu/api/publication/3168016}, author = {Kalmár-Nagy, Tamás and Giovanni, Giardini and Bak, Bendegúz Dezső}, doi = {10.1155/2017/3813912}, journal-iso = {COMPLEXITY}, journal = {COMPLEXITY}, volume = {2017}, unique-id = {3168016}, issn = {1076-2787}, year = {2017}, eissn = {1099-0526}, orcid-numbers = {Kalmár-Nagy, Tamás/0000-0003-1374-2620; Bak, Bendegúz Dezső/0000-0003-1378-875X} } @article{MTMT:2829366, title = {Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem}, url = {https://m2.mtmt.hu/api/publication/2829366}, author = {Giardini, Giovanni and Kalmár-Nagy, Tamás}, doi = {10.1155/2011/483643}, journal-iso = {MATH PROBL ENG}, journal = {MATHEMATICAL PROBLEMS IN ENGINEERING}, volume = {2011}, unique-id = {2829366}, issn = {1024-123X}, abstract = {The purpose of this paper is to present a combinatorial planner for autonomous systems. The approach is demonstrated on the so-called subtour problem, a variant of the classical traveling salesman problem (TSP): given a set of}, year = {2011}, eissn = {1563-5147}, orcid-numbers = {Kalmár-Nagy, Tamás/0000-0003-1374-2620} }