{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T23:19:10Z","timestamp":1775258350190,"version":"3.50.1"},"reference-count":31,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,8,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In order to be acceptable and able to \u201ccamouflage\u201d into their physio-social context in the long run, robots need to be not just functional, but autonomously psycho-affective as well. This motivates a long term necessity of introducing behavioral autonomy in robots, so they can autonomously communicate with humans without the need of \u201cwizard\u201d intervention. This paper proposes a technique to learn robot speech models from human-robot dialog exchanges. It views the entire exchange in the Automated Planning (AP) paradigm, representing the dialog sequences (speech acts) in the form of action sequences that modify the state of the world upon execution, gradually propelling the state to a desired goal. We then exploit intra-action and inter-action dependencies, encoding them in the form of constraints. We attempt to satisfy these constraints using aweighted maximum satisfiability model known as MAX-SAT, and convert the solution into a speech model. This model could have many uses, such as planning of fresh dialogs. In this study, the learnt model is used to predict speech acts in the dialog sequences using the sequence labeling (predicting future acts based on previously seen ones) capabilities of the LSTM (Long Short Term Memory) class of recurrent neural networks. Encouraging empirical results demonstrate the utility of this learnt model and its long term potential to facilitate autonomous behavioral planning of robots, an aspect to be explored in future works.<\/jats:p>","DOI":"10.1515\/pjbr-2018-0015","type":"journal-article","created":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T05:06:24Z","timestamp":1540530384000},"page":"295-306","source":"Crossref","is-referenced-by-count":1,"title":["Learning Robot Speech Models to Predict Speech Acts in HRI"],"prefix":"10.1515","volume":"9","author":[{"given":"Ankuj","family":"Arora","sequence":"first","affiliation":[{"name":"Grenoble Alpes, CNRS, Grenoble INP, LIG, 38000 Grenoble , France"}]},{"given":"Humbert","family":"Fiorino","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes, CNRS, Grenoble INP, LIG, 38000 Grenoble , France"}]},{"given":"Damien","family":"Pellier","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes, CNRS, Grenoble INP, LIG, 38000 Grenoble , France"}]},{"given":"Sylvie","family":"Pesty","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes, CNRS, Grenoble INP, LIG, 38000 Grenoble , France"}]}],"member":"374","published-online":{"date-parts":[[2018,10,5]]},"reference":[{"key":"2022042712092646773_j_pjbr-2018-0015_ref_001_w2aab3b7c15b1b6b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"[1] C. Breazeal, Emotion and sociable humanoid robots, International Journal of Human-Computer Studies, 2003, 59(1), 119-155, https:\/\/doi.org\/10.1016\/S1071-5819(03)00018-110.1016\/S1071-5819(03)00018-1","DOI":"10.1016\/S1071-5819(03)00018-1"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_002_w2aab3b7c15b1b6b1ab1ab2Aa","doi-asserted-by":"crossref","unstructured":"[2] C. Breazeal, Social interactions in HRI: the robot view, IEEE Transactions on Systems, Man, and Cybernetics, 2004, 34(2), 181-186, https:\/\/doi.org\/10.1109\/TSMCC.2004.82626810.1109\/TSMCC.2004.826268","DOI":"10.1109\/TSMCC.2004.826268"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_003_w2aab3b7c15b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"[3] B. D. Argall, S. Chernova, M. Veloso, B. Browning, A survey of robot learning from demonstration, Robotics and autonomous systems, 2003, 57(5), 469-483, https:\/\/doi.org\/10.1016\/j.robot.2008.10.02410.1016\/j.robot.2008.10.024","DOI":"10.1016\/j.robot.2008.10.024"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_004_w2aab3b7c15b1b6b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"[4] D. B. Jayagopi, S. Sheikhi, D. Klotz, J. Wienke, J. M. Odobez, S. Wrede el al., The vernissage corpus: A multimodal human-robotinteraction dataset (No. EPFL-REPORT-182715), 201210.1109\/HRI.2013.6483545","DOI":"10.1109\/HRI.2013.6483545"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_005_w2aab3b7c15b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"[5] C. R. Perrault, An application of default logic to speech act theory, Intentions in Communication, 1990, 161-186","DOI":"10.7551\/mitpress\/3839.003.0011"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_006_w2aab3b7c15b1b6b1ab1ab6Aa","unstructured":"[6] M. D. Sadek, Dialogue acts are rational plans, The Structure of Multimodal Dialogue (Second VENACO Workshop), 1991"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_007_w2aab3b7c15b1b6b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"[7] J. Riviere, C. Adam, S. Pesty, C. Pelachaud, N. Guiraud, D. Longin et al., Expressive multimodal conversational acts for SAIBA agents, International Workshop on Intelligent Virtual Agents, 2011, 316-32310.1007\/978-3-642-23974-8_34","DOI":"10.1007\/978-3-642-23974-8_34"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_008_w2aab3b7c15b1b6b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"[8] Y. LeCun, Y. Bengio, G. Hinton, Deep learning, Nature, 2015, 521(7553), 436-44410.1038\/nature1453926017442","DOI":"10.1038\/nature14539"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_009_w2aab3b7c15b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"[9] O. Sigaud, A. Droniou, Towards deep developmental learning, IEEE Transactions on Cognitive and Developmental Systems, 2016, 8(2), 99-11410.1109\/TAMD.2015.2496248","DOI":"10.1109\/TAMD.2015.2496248"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_010_w2aab3b7c15b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"[10] S. Hochreiter, J. Schmidhuber, Long short-term memory, Neural computation, 1997, 9(8), 1735-178010.1162\/neco.1997.9.8.17359377276","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_011_w2aab3b7c15b1b6b1ab1ac11Aa","unstructured":"[11] S. Jim\u00e9nez, F. Fern\u00e1ndez, D. Borrajo, The PELA architecture: integrating planning and learning to improve execution, Association for the Advancement of Artificial Intelligence, 2008"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_012_w2aab3b7c15b1b6b1ab1ac12Aa","doi-asserted-by":"crossref","unstructured":"[12] S. J. Pan, Q. Yang, A survey on transfer learning, IEEE Transactions on Knowledge and Data engineering, 2010, 22(10), 1345-135910.1109\/TKDE.2009.191","DOI":"10.1109\/TKDE.2009.191"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_013_w2aab3b7c15b1b6b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"[13] H. H. Zhuo, Q. Yang, Action-model acquisition for planning via transfer learning, Artificial Intelligence, 2014, 212, 80-10310.1016\/j.artint.2014.03.004","DOI":"10.1016\/j.artint.2014.03.004"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_014_w2aab3b7c15b1b6b1ab1ac14Aa","doi-asserted-by":"crossref","unstructured":"[14] R. Garc\u00eda-Mart\u00ednez, D. Borrajo, An integrated approach of learning, planning, and execution, Journal of Intelligent and Robotic Systems, 2000, 29(1), 47-7810.1023\/A:1008134010576","DOI":"10.1023\/A:1008134010576"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_015_w2aab3b7c15b1b6b1ab1ac15Aa","doi-asserted-by":"crossref","unstructured":"[15] Q. Yang, K.Wu, Y. Jiang, Learning action models from plan examples using weightedMAX-SAT, Artificial Intelligence, 2007, 171(2-3), 107-14310.1016\/j.artint.2006.11.005","DOI":"10.1016\/j.artint.2006.11.005"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_016_w2aab3b7c15b1b6b1ab1ac16Aa","unstructured":"[16] H. H. Zhuo, T. A. Nguyen, S. Kambhampati, Refining incomplete planning domain models through plan traces, International Joint Conference on Artificial Intelligence, 2013, 2451-2458"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_017_w2aab3b7c15b1b6b1ab1ac17Aa","unstructured":"[17] S. Yoon, S. Kambhampati, Towards model-lite planning: A proposal for learning & planning with incomplete domain models, ICAPS 2007 Workshop on Artificial Intelligence Planning and Learning, 2007"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_018_w2aab3b7c15b1b6b1ab1ac18Aa","doi-asserted-by":"crossref","unstructured":"[18] H. H. Zhuo, H. Mu\u00f1oz-Avila, Q. Yang, Learning action models for multi-agent planning, The 10th International Conference on Autonomous Agents and Multiagent Systems, 2011, 1, 217-224","DOI":"10.65109\/NCHM4223"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_019_w2aab3b7c15b1b6b1ab1ac19Aa","unstructured":"[19] R. Agrawal, R. Srikant, Fast algorithms for mining association rules, International Conference on Very Large Data Bases, 1994, 1215, 487-499"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_020_w2aab3b7c15b1b6b1ab1ac20Aa","doi-asserted-by":"crossref","unstructured":"[20] W. K. Fung, Y. H. Liu, Adaptive categorization of ART networks in robot behavior learning using game-theoretic formulation, Neural Networks, 2003, 16(10), 1403-142010.1016\/S0893-6080(03)00080-7","DOI":"10.1016\/S0893-6080(03)00080-7"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_021_w2aab3b7c15b1b6b1ab1ac21Aa","doi-asserted-by":"crossref","unstructured":"[21] F. Stulp, A. Fedrizzi, L. M\u00f6senlechner, M. Beetz, Learning and reasoning with action-related places for robust mobile manipulation, Journal of Artifial Intelligence, 2012, 43, 1-4210.1613\/jair.3451","DOI":"10.1613\/jair.3451"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_022_w2aab3b7c15b1b6b1ab1ac22Aa","unstructured":"[22] D. McDermott, M. Ghallab, A. Howe, C. Knoblock, A. Ram, M. Veloso et al., PDDL-the planning domain definition language, 1998"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_023_w2aab3b7c15b1b6b1ab1ac23Aa","unstructured":"[23] M. Brenner, Multiagent planning with partially ordered temporal plans, International Joint Conference on Artificial Intelligence, 2003, 3, 1513-1514"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_024_w2aab3b7c15b1b6b1ab1ac24Aa","unstructured":"[24] K. Garoufi, A. Koller, Automated planning for situated natural language generation, Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, 2010, 1573- 1582"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_025_w2aab3b7c15b1b6b1ab1ac25Aa","unstructured":"[25] T. Marques, M. Rovatsos, Classical planning with communicative actions, European Conference on Artificial Intelligence, 2016, 1744-1745"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_026_w2aab3b7c15b1b6b1ab1ac26Aa","doi-asserted-by":"crossref","unstructured":"[26] R. E. Fikes, N. J. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence, 1971, 2(3-4), 189-20810.1016\/0004-3702(71)90010-5","DOI":"10.1016\/0004-3702(71)90010-5"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_027_w2aab3b7c15b1b6b1ab1ac27Aa","doi-asserted-by":"crossref","unstructured":"[27] H. Mannila, H. Toivonen, A. I. Verkamo, Discovery of frequent episodes in event sequences, Data Mining and Knowledge Discovery, 1997, 1(3), 259-28910.1023\/A:1009748302351","DOI":"10.1023\/A:1009748302351"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_028_w2aab3b7c15b1b6b1ab1ac28Aa","unstructured":"[28] C. Dousson, T. V. Duong, Discovering Chronicles with Numerical Time Constraints from Alarm Logs for Monitoring Dynamic Systems, International Joint Conference on Artificial Intelligence, 1999, 99, 620-626"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_029_w2aab3b7c15b1b6b1ab1ac29Aa","unstructured":"[29] M. Guillame-Bert, J. L. Crowley, Learning temporal association rules on symbolic time sequences, In: Proceedings of the Asian Conference on Machine Learning, PMLR, 2012, 25, 159-174"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_030_w2aab3b7c15b1b6b1ab1ac30Aa","doi-asserted-by":"crossref","unstructured":"[30] B. Borchers, J. Furman, A two-phase exact algorithm for MAXSAT and weighted MAX-SAT problems, Journal of Combinatorial Optimization, 1998, 2(4), 299-30610.1023\/A:1009725216438","DOI":"10.1023\/A:1009725216438"},{"key":"2022042712092646773_j_pjbr-2018-0015_ref_031_w2aab3b7c15b1b6b1ab1ac31Aa","doi-asserted-by":"crossref","unstructured":"[31] H. A. Kautz, B. Selman, Y. Jiang, A general stochastic approach to solving problemswith hard and soft constraints, Satisfiability Problem: Theory and Applications, 1996, 35, 573-58610.1090\/dimacs\/035\/15","DOI":"10.1090\/dimacs\/035\/15"}],"container-title":["Paladyn, Journal of Behavioral Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/pjbr.2018.9.issue-1\/pjbr-2018-0015\/pjbr-2018-0015.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/pjbr-2018-0015\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/pjbr-2018-0015\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:56:15Z","timestamp":1775253375000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/pjbr-2018-0015\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,1]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,7,25]]},"published-print":{"date-parts":[[2018,7,1]]}},"alternative-id":["10.1515\/pjbr-2018-0015"],"URL":"https:\/\/doi.org\/10.1515\/pjbr-2018-0015","relation":{},"ISSN":["2081-4836"],"issn-type":[{"value":"2081-4836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,1]]}}}