{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:06:51Z","timestamp":1648879611152},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2002,5,17]],"date-time":"2002-05-17T00:00:00Z","timestamp":1021593600000},"content-version":"unspecified","delay-in-days":136,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIEDAM"],"published-print":{"date-parts":[[2002,1]]},"abstract":"<jats:p>This paper proposes a new logical framework for vehicle \nroute-sequence planning of passenger travel requests. Each request \nis a <jats:italic>fetch-and-send<\/jats:italic> service task associated with \ntwo request-locations, namely, a source and a destination. The \nproposed framework is developed using propositional linear time \ntemporal logic of Manna and Pnueli. The novelty lies in the \nuse of the formal language for both the specification and \ntheorem-proving analysis of precedence constraints among the \nlocation visits that are inherent in route sequences. In the \nframework, legal route sequences\u2014each of which visits \nevery request location once and only once in the precedence \norder of fetch-and-send associated with every such request\u2014is \nformalized and justified, forming a basis upon which the link \nbetween a basic precedence constraint and the corresponding \ncanonical forbidden-state formula is formally established. Over \na given base route plan, a simple procedure to generate a feasible \nsubplan based on a specification of the forbidden-state canonical \nform is also given. An example demonstrates how temporal logic \nanalysis and the proposed procedure can be applied to select \na final (feasible) subplan based on additional precedence constraints.<\/jats:p>","DOI":"10.1017\/s0890060401020042","type":"journal-article","created":{"date-parts":[[2002,11,14]],"date-time":"2002-11-14T21:55:46Z","timestamp":1037310946000},"page":"31-38","source":"Crossref","is-referenced-by-count":0,"title":["Vehicle route-sequence planning using temporal logic"],"prefix":"10.1017","volume":"16","author":[{"given":"KIAM TIAN","family":"SEOW","sequence":"first","affiliation":[]},{"given":"MICHEL","family":"PASQUIER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2002,5,17]]},"container-title":["Artificial Intelligence for Engineering Design, Analysis and Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0890060401020042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T19:01:37Z","timestamp":1553972497000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0890060401020042\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0890060401020042"],"URL":"https:\/\/doi.org\/10.1017\/s0890060401020042","relation":{},"ISSN":["0890-0604","1469-1760"],"issn-type":[{"value":"0890-0604","type":"print"},{"value":"1469-1760","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}