{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:12Z","timestamp":1740099612217,"version":"3.37.3"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030374938"},{"type":"electronic","value":"9783030374945"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37494-5_7","type":"book-chapter","created":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T15:02:38Z","timestamp":1576335758000},"page":"118-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-agent Path Finding with Generalized Conflicts: An Experimental Study"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7200-0542","authenticated-orcid":false,"given":"Pavel","family":"Surynek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,15]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-39071-5_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"Gilles Audemard","year":"2013","unstructured":"Audemard, G., Lagniez, J., Simon, L.: Improving glucose for incremental SAT solving with assumptions: application to MUS extraction. In: SAT, pp. 309\u2013317 (2013)"},{"key":"7_CR2","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: IJCAI, pp. 399\u2013404 (2009)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Balyo, T., Heule, M.J.H., J\u00e4rvisalo, M.: SAT competition 2016: recent developments. In: AAAI, pp. 5061\u20135063 (2017)","DOI":"10.1609\/aaai.v31i1.10641"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1109\/TASE.2012.2215322","volume":"9","author":"F Basile","year":"2012","unstructured":"Basile, F., Chiacchio, P., Coppola, J.: A hybrid model of complex automated warehouse systems - part I: modeling and simulation. IEEE Trans. Autom. Sci. Eng. 9(4), 640\u2013653 (2012)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"7_CR5","unstructured":"Biere, A., Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications. IOS Press, Amsterdam (2009)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10601-012-9123-1","volume":"17","author":"M Bofill","year":"2012","unstructured":"Bofill, M., Palah\u00ed, M., Suy, J., Villaret, M.: Solving constraint satisfaction problems with SAT modulo theories. Constraints 17(3), 273\u2013303 (2012)","journal-title":"Constraints"},{"issue":"9","key":"7_CR7","doi-asserted-by":"publisher","first-page":"2656","DOI":"10.1007\/s00453-017-0387-0","volume":"80","author":"\u00c9douard Bonnet","year":"2017","unstructured":"Bonnet, \u00c9., Miltzow, T., Rzazewski, P.: Complexity of token swapping and its variants. In: STACS 2017. LIPIcs, vol. 66, pp. 16:1\u201316:14. Schloss Dagstuhl (2017)","journal-title":"Algorithmica"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Botea, A., Kishimoto, A., Marinescu, R.: On the complexity of quantum circuit compilation. In: Bulitko, V., Storandt, S. (eds.) Proceedings of the Eleventh International Symposium on Combinatorial Search, SOCS 2018, Stockholm, Sweden - 14\u201315 July 2018, pp. 138\u2013142. AAAI Press (2018)","DOI":"10.1609\/socs.v9i1.18463"},{"key":"7_CR9","unstructured":"Boyarski, E., et al.: ICBS: improved conflict-based search algorithm for multi-agent pathfinding. In: IJCAI, pp. 740\u2013746 (2015)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1613\/jair.2502","volume":"31","author":"K Dresner","year":"2008","unstructured":"Dresner, K., Stone, P.: A multiagent approach to autonomous intersection management. JAIR 31, 591\u2013656 (2008)","journal-title":"JAIR"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Felner, A., et al.: Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges. In: Proceedings of the Tenth International Symposium on Combinatorial Search, SOCS 2017, pp. 29\u201337. AAAI Press (2017)","DOI":"10.1609\/socs.v8i1.18423"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Kapadia, M., Ninomiya, K., Shoulson, A., Garcia, F.M., Badler, N.I.: Constraint-aware navigation in dynamic environments. In: Motion in Games, MIG 2013, Dublin, Ireland, 6\u20138 November 2013, pp. 111\u2013120. ACM (2013)","DOI":"10.1145\/2522628.2522654"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-319-53925-6_35","volume-title":"WALCOM: Algorithms and Computation","author":"J Kawahara","year":"2017","unstructured":"Kawahara, J., Saitoh, T., Yoshinaka, R.: The time complexity of the token swapping problem and its parallel variants. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 448\u2013459. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53925-6_35"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"839","DOI":"10.20965\/jaciii.2014.p0839","volume":"18","author":"DG Kim","year":"2014","unstructured":"Kim, D.G., Hirayama, K., Park, G.K.: Collision avoidance in multiple-ship situations by distributed local search. J. Adv. Comput. Intell. Intell. Inform. 18, 839\u2013848 (2014)","journal-title":"J. Adv. Comput. Intell. Intell. Inform."},{"key":"7_CR15","first-page":"241","volume":"1984","author":"D Kornhauser","year":"1984","unstructured":"Kornhauser, D., Miller, G.L., Spirakis, P.G.: Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. FOCS 1984, 241\u2013250 (1984)","journal-title":"FOCS"},{"key":"7_CR16","unstructured":"Luna, R., Bekris, K.E.: Push and swap: fast cooperative path-finding with completeness guarantees. In: IJCAI, pp. 294\u2013300 (2011)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Luna, R., Bekris, K.: Efficient and complete centralized multi-robot path planning. In: IROS, pp. 3268\u20133275 (2011)","DOI":"10.1109\/IROS.2011.6095085"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Luna, R., Bekris, K.E.: Network-guided multi-robot path planning in discrete representations. In: IROS, pp. 4596\u20134602 (2010)","DOI":"10.1109\/IROS.2010.5649064"},{"key":"7_CR19","unstructured":"Miltzow, T., Narins, L., Okamoto, Y., Rote, G., Thomas, A., Uno, T.: Approximation and hardness of token swapping. In: ESA 2016. LIPIcs, vol. 57, pp. 66:1\u201366:15. Schloss Dagstuhl (2016)"},{"issue":"6","key":"7_CR20","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract davis-putnam-logemann-loveland procedure to dpll(T). J. ACM 53(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"key":"7_CR21","unstructured":"Ratner, D., Warmuth, M.K.: Finding a shortest solution for the N x N extension of the 15-puzzle is intractable. In: AAAI, pp. 168\u2013172 (1986)"},{"key":"7_CR22","unstructured":"Ryan, M.R.K.: Graph decomposition for efficient multi-robot path planning. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 2003\u20132008 (2007)"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1613\/jair.2408","volume":"31","author":"MRK Ryan","year":"2008","unstructured":"Ryan, M.R.K.: Exploiting subgraph structure in multi-robot path planning. J. Artif. Intell. Res. (JAIR) 31, 497\u2013542 (2008)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015)","journal-title":"Artif. Intell."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.artint.2012.11.006","volume":"195","author":"G Sharon","year":"2013","unstructured":"Sharon, G., Stern, R., Goldenberg, M., Felner, A.: The increasing cost tree search for optimal multi-agent pathfinding. Artif. Intell. 195, 470\u2013495 (2013)","journal-title":"Artif. Intell."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent path finding. In: AAAI (2012)","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: AIIDE, pp. 117\u2013122 (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Standley, T.: Finding optimal solutions to cooperative pathfinding problems. In: AAAI, pp. 173\u2013178 (2010)","DOI":"10.1609\/aaai.v24i1.7564"},{"issue":"2","key":"7_CR29","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TCIAIG.2012.2197681","volume":"4","author":"NR Sturtevant","year":"2012","unstructured":"Sturtevant, N.R.: Benchmarks for grid-based pathfinding. Comput. Intell. AI Games 4(2), 144\u2013148 (2012)","journal-title":"Comput. Intell. AI Games"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-642-32695-0_50","volume-title":"PRICAI 2012: Trends in Artificial Intelligence","author":"P Surynek","year":"2012","unstructured":"Surynek, P.: Towards optimal cooperative path planning in hard setups through satisfiability solving. In: Anthony, P., Ishizuka, M., Lukose, D. (eds.) PRICAI 2012. LNCS (LNAI), vol. 7458, pp. 564\u2013576. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32695-0_50"},{"key":"7_CR31","first-page":"151","volume":"2009","author":"P Surynek","year":"2009","unstructured":"Surynek, P.: An application of pebble motion on graphs to abstract multi-robot path planning. ICTAI 2009, 151\u2013158 (2009)","journal-title":"ICTAI"},{"key":"7_CR32","first-page":"3613","volume":"2009","author":"P Surynek","year":"2009","unstructured":"Surynek, P.: A novel approach to path planning for multiple robots in bi-connected graphs. ICRA 2009, 3613\u20133619 (2009)","journal-title":"ICRA"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Surynek, P.: An optimization variant of multi-robot path planning is intractable. In: AAAI 2010. AAAI Press (2010)","DOI":"10.5772\/12906"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Surynek, P.: On propositional encodings of cooperative path-finding. In: ICTAI 2012, pp. 524\u2013531. IEEE Computer Society (2012)","DOI":"10.1109\/ICTAI.2012.77"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Surynek, P.: Compact representations of cooperative path-finding as SAT based on matchings in bipartite graphs. In: ICTAI, pp. 875\u2013882 (2014)","DOI":"10.1109\/ICTAI.2014.134"},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-319-13650-9_36","volume-title":"Nature-Inspired Computation and Machine Learning","author":"P Surynek","year":"2014","unstructured":"Surynek, P.: Simple direct propositional encoding of cooperative path finding simplified yet more. In: Gelbukh, A., Espinoza, F.C., Galicia-Haro, S.N. (eds.) MICAI 2014. LNCS (LNAI), vol. 8857, pp. 410\u2013425. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13650-9_36"},{"issue":"2","key":"7_CR37","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1111\/coin.12002","volume":"30","author":"P Surynek","year":"2014","unstructured":"Surynek, P.: Solving abstract cooperative path-finding in densely populated environments. Comput. Intell. 30(2), 402\u2013450 (2014)","journal-title":"Comput. Intell."},{"issue":"3\u20134","key":"7_CR38","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10472-017-9560-z","volume":"81","author":"P Surynek","year":"2017","unstructured":"Surynek, P.: Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems. Ann. Math. Artif. Intell. 81(3\u20134), 329\u2013375 (2017)","journal-title":"Ann. Math. Artif. Intell."},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Surynek, P.: Finding optimal solutions to token swapping by conflict-based search and reduction to SAT. In: IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018, pp. 592\u2013599. IEEE (2018)","DOI":"10.1109\/ICTAI.2018.00096"},{"key":"7_CR40","unstructured":"Surynek, P.: Lazy modeling of variants of token swapping problem and multi-agent path finding through combination of satisfiability modulo theories and conflict-based search. CoRR abs\/1809.05959 (2018). http:\/\/arxiv.org\/abs\/1809.05959"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Surynek, P.: Conflict handling framework in generalized multi-agent path finding: advantages and shortcomings of satisfiability modulo approach. In: Proceedings of the 11th International Conference on Agents and Artificial Intelligence, ICAART 2019, vol. 2, pp. 192\u2013203. SciTePress (2019)","DOI":"10.5220\/0007374201920203"},{"key":"7_CR42","unstructured":"Surynek, P., Felner, A., Stern, R., Boyarski, E.: Efficient SAT approach to multi-agent path finding under the sum of costs objective. In: ECAI, pp. 810\u2013818 (2016)"},{"key":"7_CR43","unstructured":"Surynek, P., Felner, A., Stern, R., Boyarski, E.: An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives. In: Symposium on Combinatorial Search (SoCS) (2016)"},{"issue":"2","key":"7_CR44","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2002.1211","volume":"42","author":"M Thorup","year":"2002","unstructured":"Thorup, M.: Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations. J. Algorithms 42(2), 205\u2013230 (2002)","journal-title":"J. Algorithms"},{"key":"7_CR45","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-319-11209-1_36","volume-title":"Case-Based Reasoning Research and Development","author":"S Wender","year":"2014","unstructured":"Wender, S., Watson, I.: Combining case-based reasoning and reinforcement learning for unit navigation in real-time strategy game AI. In: Lamontagne, L., Plaza, E. (eds.) ICCBR 2014. LNCS (LNAI), vol. 8765, pp. 511\u2013525. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11209-1_36"},{"key":"7_CR46","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.4447","volume":"51","author":"B Wilde de","year":"2014","unstructured":"de Wilde, B., ter Mors, A., Witteveen, C.: Push and rotate: a complete multi-agent pathfinding algorithm. JAIR 51, 443\u2013492 (2014)","journal-title":"JAIR"},{"issue":"1","key":"7_CR47","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0095-8956(74)90098-7","volume":"16","author":"RM Wilson","year":"1974","unstructured":"Wilson, R.M.: Graph puzzles, homotopy, and the alternating group. J. Comb. Theory Ser. B 16(1), 86\u201396 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-319-53925-6_34","volume-title":"WALCOM: Algorithms and Computation","author":"K Yamanaka","year":"2017","unstructured":"Yamanaka, K., et al.: Sequentially swapping colored tokens on graphs. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 435\u2013447. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53925-6_34"},{"key":"7_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/978-3-319-07890-8_31","volume-title":"FUN 2014 Proceedings","author":"K Yamanaka","year":"2014","unstructured":"Yamanaka, K., et al.: Swapping labeled tokens on graphs. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) FUN 2014 Proceedings. LNCS, vol. 8496, pp. 364\u2013375. Springer, Heidelberg (2014)"},{"key":"7_CR50","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2015.01.052","volume":"586","author":"K Yamanaka","year":"2015","unstructured":"Yamanaka, K., et al.: Swapping labeled tokens on graphs. Theor. Comput. Sci. 586, 81\u201394 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR51","unstructured":"Yamanaka, K., et al.: Computational complexity of colored token swapping problem. In: IPSJ SIG Technical Report, vol. 156 (2016)"},{"issue":"1","key":"7_CR52","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TRO.2006.886840","volume":"23","author":"A Yershova","year":"2007","unstructured":"Yershova, A., LaValle, S.M.: Improving motion-planning algorithms by efficient nearest-neighbor searching. IEEE Trans. Robot. 23(1), 151\u2013157 (2007)","journal-title":"IEEE Trans. Robot."},{"key":"7_CR53","first-page":"3612","volume":"2013","author":"J Yu","year":"2013","unstructured":"Yu, J., LaValle, S.M.: Planning optimal paths for multiple robots on graphs. ICRA 2013, 3612\u20133617 (2013)","journal-title":"ICRA"},{"key":"7_CR54","unstructured":"Yu, J., LaValle, S.M.: Optimal multi-robot path planning on graphs: structure and computational complexity. CoRR abs\/1507.03289 (2015)"},{"issue":"5","key":"7_CR55","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/TRO.2016.2593448","volume":"32","author":"J Yu","year":"2016","unstructured":"Yu, J., LaValle, S.M.: Optimal multirobot path planning on graphs: complete algorithms and effective heuristics. IEEE Trans. Robot. 32(5), 1163\u20131177 (2016)","journal-title":"IEEE Trans. Robot."},{"key":"7_CR56","doi-asserted-by":"crossref","unstructured":"Yu, J., Rus, D.: Pebble motion on graphs with rotations: efficient feasibility tests and planning algorithms. In: Eleventh Workshop on the Algorithmic Fundations of Robotics (2014)","DOI":"10.1007\/978-3-319-16595-0_42"},{"key":"7_CR57","first-page":"1737","volume":"2015","author":"D Zhou","year":"2015","unstructured":"Zhou, D., Schwager, M.: Virtual rigid bodies for coordinated agile maneuvering of teams of micro aerial vehicles. ICRA 2015, 1737\u20131742 (2015)","journal-title":"ICRA"}],"container-title":["Lecture Notes in Computer Science","Agents and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37494-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T00:32:24Z","timestamp":1695515544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37494-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030374938","9783030374945"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37494-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Agents and Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaart2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaart.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"202","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36 poster papers were also accepted. 17 of the 46 accepted full papers are included in LNAI 11978.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}