<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81"><efrbr-work:titleOfTheWork>Vehicle trajectory specification in presence of traffic lights with known or uncertain switching times</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81"><efrbr-expression:titleOfTheExpression>Vehicle trajectory specification in presence of traffic lights with known or uncertain switching times</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2021-07-16</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2020</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>The main purpose of this work is to generate optimal trajectories for vehicles crossing a signalized junction, with traffic signals operated in either fixed-time or real-time (adaptive) mode. In the latter case, the next switching time is decided in real time based on the prevailing traffic conditions and is therefore uncertain in advance. The GLOSA (Green Light Optimal Speed Advisory) problem is addressed by using traffic lights information and calculating a trajectory and velocity profile for the vehicle based on the vehicle's initial state (position and speed) and a fixed final destination state. At first, an appropriate optimal control problem is formulated and solved analytically via Pontryagin's minimum principle (PMP) for the case of known switching times. Subsequently, for the case of real-time signals, availability of a time-window of possible signal switching times, along with the corresponding probability distribution, is assumed, and the problem is cast in the format of a stochastic optimal control problem and is solved numerically using stochastic dynamic programming (SDP) techniques. Application results, for various driving scenarios, of the deterministic approach, which considers the case of known switching times, and a comprehensive comparison of the stochastic GLOSA approach with a sub-optimal approach are presented. In particular, it is demonstrated that the proposed SDP approach achieves better average performance compared with the sub-optimal approach because of the better (probabilistic) information on the traffic light switching time.</efrbr-expression:summarizationOfContent><efrbr-expression:contextForTheExpression>The authors received funding from the European Research Council under the European Union's Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement no. 321132, project TRAMAN21.</efrbr-expression:contextForTheExpression><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="journal name">Transportation Research Record</efrbr-expression:note><efrbr-expression:note type="journal volume">2674</efrbr-expression:note><efrbr-expression:note type="journal number">8</efrbr-expression:note><efrbr-expression:note type="page range">53-66</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~ptypaldos"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Typaldos Panagiotis
            Τυπαλδος Παναγιωτης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~ikalogianni"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Kalogianni Ioanna
            Καλογιαννη Ιωαννα
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~kmountakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Mountakis Kyriakos-Simon
            Μουντακης Κυριακος-Σιμων
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~ipapa"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Papamichail Ioannis
            Παπαμιχαηλ Ιωαννης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~mpapageorgiou"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Papageorgiou Markos
            Παπαγεωργιου Μαρκος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="https://v2.sherpa.ac.uk/id/publisher/65"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            SAGE Publications
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="DD139676-D200-494F-B162-D0236FF54926"><efrbr-concept:termForTheConcept>
            GLOSA (Green Light Optimal Speed Advisory) problem
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="F3754E2E-017F-49AA-B3D7-D1F9538B1D84"><efrbr-concept:termForTheConcept>
            Pontryagin's minimum principle (PMP)
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="BBA4BF64-7988-4469-8C77-86C5D557E2CA"><efrbr-concept:termForTheConcept>
            Stochastic Dynamic Programming (SDP) techniques
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="person" targetURI="http://users.isc.tuc.gr/~ptypaldos"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="person" targetURI="http://users.isc.tuc.gr/~ptypaldos" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="person" targetURI="http://users.isc.tuc.gr/~ikalogianni" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="person" targetURI="http://users.isc.tuc.gr/~kmountakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="person" targetURI="http://users.isc.tuc.gr/~ipapa" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mpapageorgiou" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="person" targetURI="https://v2.sherpa.ac.uk/id/publisher/65" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="concept" targetURI="DD139676-D200-494F-B162-D0236FF54926"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="concept" targetURI="F3754E2E-017F-49AA-B3D7-D1F9538B1D84"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/E2715CED-8EE7-4195-B7D2-3B66481A6B81" targetEntity="concept" targetURI="BBA4BF64-7988-4469-8C77-86C5D557E2CA"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>