Change search
Refine search result
1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Johansson, Alexander
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Automatic Control.
    Nekouei, Ehsan
    KTH, School of Electrical Engineering and Computer Science (EECS), Automatic Control.
    Johansson, Karl Henrik
    KTH, School of Electrical Engineering and Computer Science (EECS), Automatic Control.
    Mårtensson, Jonas
    KTH, School of Electrical Engineering and Computer Science (EECS), Automatic Control.
    Multi-Fleet Platoon Matching: A Game-Theoretic Approach2018In: 2018 21ST INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), IEEE , 2018, p. 2980-2985Conference paper (Refereed)
    Abstract [en]

    We consider the platoon matching problem for a set of trucks with the same origin, but different destinations. It is assumed that the vehicles benefit from traveling in a platoon for instance through reduced fuel consumption. The vehicles belong to different fleet owners and their strategic interaction is modeled as a non-cooperative game where the vehicle actions are their departure times. Each truck has a preferred departure time and its utility function is defined as the difference between its benefit from platooning and the cost of deviating from its preferred departure time. We show that the platoon matching game is an exact potential game. An algorithm based on best response dynamics is proposed for finding a Nash equilibrium of the game. At a Nash equilibrium, vehicles with the same departure time are matched to form a platoon. Finally, the total fuel reduction at the Nash equilibrium is studied and compared with that of a cooperative matching solution where a common utility function for all vehicles is optimized.

  • 2.
    Johansson, Alexander
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Wei, Jieqiang
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Sandberg, Henrik
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Johansson, Karl H.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Chen, J.
    Optimization of the H∞-norm of Dynamic Flow Networks2018In: 2018 Annual American Control Conference (ACC), Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 1280-1285Conference paper (Refereed)
    Abstract [en]

    In this paper, we study the H∞-norm of linear systems over graphs, which is used to model distribution networks. In particular, we aim to minimize the H∞-norm subject to allocation of the weights on the edges. The optimization problem is formulated with LMI (Linear-Matrix-Inequality) constraints. For distribution networks with one port, i.e., SISO systems, we show that the H∞-norm coincides with the effective resistance between the nodes in the port. Moreover, we derive an upper bound of the H∞-norm, which is in terms of the algebraic connectivity of the graph on which the distribution network is defined.

1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf