{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:20:47Z","timestamp":1743110447615,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030584740"},{"type":"electronic","value":"9783030584757"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_41","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"707-723","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Collet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8980-7585","authenticated-orcid":false,"given":"Arnaud","family":"Gotlieb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2524-9462","authenticated-orcid":false,"given":"Nadjib","family":"Lazaar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3079-8095","authenticated-orcid":false,"given":"Mats","family":"Carlsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9345-5431","authenticated-orcid":false,"given":"Dusica","family":"Marijan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten","family":"Mossige","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"issue":"2","key":"41_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10479-016-2116-5","volume":"244","author":"QT Bui","year":"2016","unstructured":"Bui, Q.T., Deville, Y., Pham, Q.D.: Exact methods for solving the elementary shortest and longest path problems. Ann. Oper. Res. 244(2), 313\u2013348 (2016). https:\/\/doi.org\/10.1007\/s10479-016-2116-5","journal-title":"Ann. Oper. Res."},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Glaser, H., Hartel, P., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 191\u2013206. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0033845"},{"key":"41_CR3","unstructured":"Chu, G., Stuckey, P.J., Schutt, A., Ehlers, T., Gange, G., Francis, K.: Chuffed, a lazy clause generation solver. https:\/\/github.com\/chuffed\/chuffed"},{"key":"41_CR4","unstructured":"Cohen, Y., Stern, R., Felner, A.: Solving the longest simple path problem with heuristic search. In: Beck, J.C., Buffet, O., Hoffmann, J., Karpas, E., Sohrabi, S. (eds.) Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, Nancy, France, 26\u201330 October 2020, pp. 75\u201379. AAAI Press (2020). https:\/\/aaai.org\/ojs\/index.php\/ICAPS\/article\/view\/6647"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Collet, M., Gotlieb, A., Lazaar, N., Mossige, M.: Stress testing of single-arm robots through constraint-based generation of continuous trajectories. In: Proceedings of the 1st IEEE Artificial Intelligence Testing Conference (AI Test 2019) (April 2019)","DOI":"10.1109\/AITest.2019.00014"},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TAC.2016.2530719","volume":"62","author":"B Desrochers","year":"2017","unstructured":"Desrochers, B., Jaulin, L.: Computing a guaranteed approximation of the zone explored by a robot. IEEE Trans. Autom. Control 62(1), 425\u2013430 (2017)","journal-title":"IEEE Trans. Autom. Control"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.mechmachtheory.2017.10.025","volume":"121","author":"C Faria","year":"2018","unstructured":"Faria, C., Ferreira, F., Erlhagen, W., Monteiro, S., Bicho, E.A.: Position-based kinematics for 7-DoF serial manipulators with global configuration control, joint limit and singularity avoidance. Mech. Mach. Theory 121, 317\u2013334 (2018)","journal-title":"Mech. Mach. Theory"},{"key":"41_CR8","unstructured":"Fieger, K., Balyo, T., Schulz, C., Schreiber, D.: Finding optimal longest paths by dynamic programming in parallel. In: Surynek, P., Yeoh, W. (eds.) Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16\u201317 July 2019, pp. 61\u201369. AAAI Press (2019). https:\/\/aaai.org\/ocs\/index.php\/SOCS\/SOCS19\/paper\/view\/18329"},{"issue":"3","key":"41_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s11786-012-0123-8","volume":"6","author":"A Gasparetto","year":"2012","unstructured":"Gasparetto, A., Boscariol, P., Lanzutti, A., Vidoni, R.: Trajectory planning in robotics. Math. Comput. Sci. 6(3), 269\u2013279 (2012)","journal-title":"Math. Comput. Sci."},{"issue":"1","key":"41_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1145\/1132973.1132980","volume":"32","author":"L Granvilliers","year":"2006","unstructured":"Granvilliers, L., Benhamou, F.: Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques. ACM TOMS 32(1), 138\u2013156 (2006)","journal-title":"ACM TOMS"},{"issue":"1","key":"41_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1011400431065","volume":"7","author":"L Jaulin","year":"2001","unstructured":"Jaulin, L.: Path planning using intervals and graphs. Reliable Comput. 7(1), 1\u201315 (2001)","journal-title":"Reliable Comput."},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Latombe, J.C.: Robot Motion Planning, chap. 1. Kluwer Academic Publishers, Norwell (1991)","DOI":"10.1007\/978-1-4615-4022-9_1"},{"key":"41_CR13","doi-asserted-by":"publisher","unstructured":"Malik, A.A., Bilberg, A.: Digital twins of human robot collaboration in a production setting. Procedia Manuf. 17, 278\u2013285 (2018). https:\/\/doi.org\/10.1016\/j.promfg.2018.10.047, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2351978918311636. 28th International Conference on Flexible Automation and Intelligent Manufacturing (FAIM2018), Columbus, OH, 11\u201314 June 2018, USAGlobal Integration of Intelligent Manufacturing and Smart Industry for Good of Humanity","DOI":"10.1016\/j.promfg.2018.10.047"},{"issue":"1\/2\/3","key":"41_CR14","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1504\/IJRS.2009.026837","volume":"3","author":"JP Merlet","year":"2009","unstructured":"Merlet, J.P.: Interval analysis and reliability in robotics. Int. J. Reliab. Saf. 3(1\/2\/3), 104\u2013130 (2009)","journal-title":"Int. J. Reliab. Saf."},{"key":"41_CR15","doi-asserted-by":"publisher","unstructured":"Minguez, J., Laumond, J.P., Lamiraux, F.: Motion planning and obstacle avoidance. In: Siciliano, B., Khatib, O. (eds.) Springer Handbook of Robotics, pp. 827\u2013852. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-30301-5_36","DOI":"10.1007\/978-3-540-30301-5_36"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Mossige, M., Gotlieb, A., Meling, H.: Using CP in automatic test generation for ABB robotics\u2019 paint control system. In: Principles and Practice of Constraint Programming (CP 2014) - Application Track, Awarded Best Application Paper, Lyon (September 2014)","DOI":"10.1007\/978-3-319-10428-7_6"},{"key":"41_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"issue":"1","key":"41_CR18","doi-asserted-by":"publisher","first-page":"1V","DOI":"10.1109\/TRO.2008.2006867","volume":"25","author":"O Oetomo","year":"2009","unstructured":"Oetomo, O., Daney, D., Merlet, J.P.: Design strategy of serial manipulators with certified constraint satisfaction. IEEE Trans. Robot. 25(1), 1V\u201311 (2009)","journal-title":"IEEE Trans. Robot."},{"issue":"1","key":"41_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cirp.2017.04.095","volume":"66","author":"S Pellegrinelli","year":"2017","unstructured":"Pellegrinelli, S., Orlandini, A., Pedrocchi, N., Umbrico, A., Tullio, T.: Motion planning and scheduling for human and robot collaboration. CIRP Ann. - Manuf. Technol. 66(1), 1\u20134 (2017)","journal-title":"CIRP Ann. - Manuf. Technol."},{"key":"41_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-29828-8_19","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"QD Pham","year":"2012","unstructured":"Pham, Q.D., Deville, Y.: Solving the longest simple path problem with constraint-based techniques. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 292\u2013306. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29828-8_19"},{"key":"41_CR21","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.robot.2017.03.020","volume":"93","author":"S Rohou","year":"2017","unstructured":"Rohou, S., Jaulin, L., Mihaylova, L., Le Bars, F., Veres, S.M.: Guaranteed computation of robots trajectories. Robot. Auton. Syst. 93, 76\u201384 (2017)","journal-title":"Robot. Auton. Syst."},{"key":"41_CR22","unstructured":"Schulte, C., Tack, G., Lagerkvist, M.: Modeling and Programming with Gecode. https:\/\/www.gecode.org\/"},{"key":"41_CR23","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1109\/TRO.2010.2044949","volume":"26","author":"M Stilman","year":"2010","unstructured":"Stilman, M.: Global manipulation planing in robot joint space with task constraints. IEEE Trans. Robot. 26, 576\u2013584 (2010)","journal-title":"IEEE Trans. Robot."},{"key":"41_CR24","unstructured":"Stuckey, P.J., Marriott, K., Tack, G.: MiniZinc manual (web resources). https:\/\/www.minizinc.org\/doc-2.4.3\/en\/index.html"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:37:52Z","timestamp":1619242672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"122","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":"55","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":"0","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":"45% - 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.13","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":"3.47","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}