{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:52:00Z","timestamp":1743058320131,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031294754"},{"type":"electronic","value":"9783031294761"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-29476-1_2","type":"book-chapter","created":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T11:03:45Z","timestamp":1679655825000},"page":"12-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Approach of Transforming Non-Markovian Reward to Markovian Reward"],"prefix":"10.1007","author":[{"given":"Ruixuan","family":"Miao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,25]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103369","volume":"289","author":"J Li","year":"2020","unstructured":"Li, J., Pu, G., Zhang, Y., et al.: Sat-based explicit ltlf satisfiability checking. Artif. Intell. 289, 103369 (2020)","journal-title":"Artif. Intell."},{"key":"2_CR2","unstructured":"Sanner, S.: Relational dynamic influence diagram language (RDDL): Language description. Unpublished ms. Australian National University 32, 27 (2010)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Li, X., Vasile, C.I., Belta, C.: Reinforcement learning with temporal logic rewards. In: 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 3834\u20133839. IEEE (2017)","DOI":"10.1109\/IROS.2017.8206234"},{"key":"2_CR4","unstructured":"Icarte, R.T., Klassen, T., Valenzano, R., et al.: Using reward machines for high-level task specification and decomposition in reinforcement learning. In: International Conference on Machine Learning. PMLR, pp. 2107\u20132116 (2018)"},{"key":"2_CR5","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley 2014)"},{"key":"2_CR6","unstructured":"Thi\u00e9baux, S., Kabanza, F., Slanley, J.: Anytime state-based solution methods for decision processes with non-Markovian rewards. arXiv preprint arXiv:1301.0606, 2012"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1613\/jair.1688","volume":"24","author":"B Bonet","year":"2005","unstructured":"Bonet, B., Geffner, H.: mGPT: a probabilistic planner based on heuristic search. J. Artif. Intell. Res. 24, 933\u2013944 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Pulver, H., Eiras, F., Carozza, L., et al.: PILOT: Efficient planning by imitation learning and optimisation for safe autonomous driving. In: 2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 1442\u20131449. IEEE (2021)","DOI":"10.1109\/IROS51168.2021.9636862"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Keller, T., Eyerich, P.: PROST: probabilistic planning based on UCT. In: Twenty-Second International Conference on Automated Planning and Scheduling (2012)","DOI":"10.1609\/icaps.v22i1.13518"},{"key":"2_CR10","unstructured":"Gei\u00dfer, F., Speck, D., Keller, T.: An analysis of the probabilistic track of the IPC 2018. In: ICAPS 2019 Workshop on the International Planning Competition (WIPC), pp. 27\u201335 (2019)"},{"key":"2_CR11","unstructured":"Camacho, A., Chen, O., Sanner, S., et al.: Non-Markovian rewards expressed in LTL: Guiding search via reward shaping (extended version). In: GoalsRL, a Workshop Collocated with ICML\/IJCAI\/AAMAS (2018)"},{"issue":"7","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1109\/TPAMI.2005.143","volume":"27","author":"SM Lucas","year":"2005","unstructured":"Lucas, S.M., Reynolds, T.J.: Learning deterministic finite automata with a smart state labeling evolutionary algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 27(7), 1063\u20131074 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Brafman, R., De Giacomo, G., Patrizi, F.: LTLf\/LDLf non-Markovian rewards. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, no. 1 (2018)","DOI":"10.1609\/aaai.v32i1.11572"},{"key":"2_CR14","unstructured":"Ng, A.Y., Harada, D., Russell, S.: Policy invariance under reward transformations: Theory and application to reward shaping. Icml 99, 278\u2013287 (1999)"},{"key":"2_CR15","unstructured":"Sohrabi, S., Baier, J.A., Mcilraith, S.A.: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence Preferred Explanations: Theory and Generation via Planning (2014)"},{"key":"2_CR16","unstructured":"Ng, A.Y., Harada, D., Russell, S.: Theory and application to reward shaping. In: Proceedings of the Sixteenth International Conference on Machine Learning (1999)"},{"key":"2_CR17","unstructured":"Little, I., Thiebaux, S.: Probabilistic planning vs. replanning. In: ICAPS Workshop on IPC: Past, Present and Future (2007)"},{"key":"2_CR18","unstructured":"Bacchus, F., Boutilier, C., Grove, A.: Rewarding behaviors. In: Proceedings of the National Conference on Artificial Intelligence, pp. 1160\u20131167 (1996)"},{"issue":"1\u20133","key":"2_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0743-1066(96)00121-5","volume":"31","author":"HJ Levesque","year":"1997","unstructured":"Levesque, H.J., Reiter, R., Lesp\u00e9rance, Y., et al.: GOLOG: a logic programming language for dynamic domains. J. Logic Program. 31(1\u20133), 59\u201383 (1997)","journal-title":"J. Logic Program."}],"container-title":["Lecture Notes in Computer Science","Structured Object-Oriented Formal Language and Method"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29476-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T11:04:14Z","timestamp":1679655854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29476-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031294754","9783031294761"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29476-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFL+MSVL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Structured Object-Oriented Formal Language and Method","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","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":"sofl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"26","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":"12","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":"46% - 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":"2","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","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":"Easy to use as a whole. Almost everything in the system is good.","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)"}}]}}