Combined scheduling and control / / edited by John D. Hedengren, Logan Beal.

Solving the problem of intersection crossing for autonomous vehicles is a challenging task due to combined combinatoric and dynamical control decisions. To reduce the complexity of the computations and distribute the resulting global optimization problem, we propose a combined scheduling-control met...

Full description

Saved in:
Bibliographic Details
TeilnehmendeR:
Place / Publishing House:[Place of publication not identified] : : MDPI AG - Multidisciplinary Digital Publishing Institute,, 2018.
Year of Publication:2018
Language:English
Physical Description:1 online resource (143 pages)
Tags: Add Tag
No Tags, Be the first to tag this record!
id 993562233904498
ctrlnum (CKB)4100000003092056
(NjHacI)994100000003092056
(EXLCZ)994100000003092056
collection bib_alma
record_format marc
spelling Combined scheduling and control / edited by John D. Hedengren, Logan Beal.
[Place of publication not identified] : MDPI AG - Multidisciplinary Digital Publishing Institute, 2018.
1 online resource (143 pages)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Description based on: online resource; title from PDF information screen (MDPI AG - Multidisciplinary Digital Publishing Institute, viewed February 20, 2023.).
Solving the problem of intersection crossing for autonomous vehicles is a challenging task due to combined combinatoric and dynamical control decisions. To reduce the complexity of the computations and distribute the resulting global optimization problem, we propose a combined scheduling-control method. Thereby, in this paper, we focus on the formulation of a resource-constrained-project-scheduling problem (RCPSP) to solve the combinatoric decision, i.e. the order in which vehicles cross an intersection area in a central coordination unit. This problem considers control decisions from the vehicles, which are computed using model predictive control (MPC) laws. In turn, the resulting scheduling solution is incorporated again in local vehicle MPC problems, which negotiate among each other to find a dynamically feasible solution. This seamless combination of scheduling and control results in efficient solutions, which is illustrated using numerical simulation and the results are compared with a first-come-first-served (FCFS) strategy.
In English.
Problem solving Data processing.
3-03842-805-1
Hedengren, John D., editor.
Beal, Logan, editor.
language English
format eBook
author2 Hedengren, John D.,
Beal, Logan,
author_facet Hedengren, John D.,
Beal, Logan,
author2_variant j d h jd jdh
l b lb
author2_role TeilnehmendeR
TeilnehmendeR
title Combined scheduling and control /
spellingShingle Combined scheduling and control /
title_full Combined scheduling and control / edited by John D. Hedengren, Logan Beal.
title_fullStr Combined scheduling and control / edited by John D. Hedengren, Logan Beal.
title_full_unstemmed Combined scheduling and control / edited by John D. Hedengren, Logan Beal.
title_auth Combined scheduling and control /
title_new Combined scheduling and control /
title_sort combined scheduling and control /
publisher MDPI AG - Multidisciplinary Digital Publishing Institute,
publishDate 2018
physical 1 online resource (143 pages)
isbn 3-03842-805-1
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA63
callnumber-sort QA 263 C663 42018
illustrated Not Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 510 - Mathematics
dewey-full 510
dewey-sort 3510
dewey-raw 510
dewey-search 510
work_keys_str_mv AT hedengrenjohnd combinedschedulingandcontrol
AT beallogan combinedschedulingandcontrol
status_str n
ids_txt_mv (CKB)4100000003092056
(NjHacI)994100000003092056
(EXLCZ)994100000003092056
carrierType_str_mv cr
is_hierarchy_title Combined scheduling and control /
author2_original_writing_str_mv noLinkedField
noLinkedField
_version_ 1764992860943286272
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02166nam a2200301 i 4500</leader><controlfield tag="001">993562233904498</controlfield><controlfield tag="005">20230220230651.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |||||||||||</controlfield><controlfield tag="008">230220s2018 xx o 000 0 eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)4100000003092056</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(NjHacI)994100000003092056</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)994100000003092056</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">NjHacI</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="c">NjHacl</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA63</subfield><subfield code="b">.C663 2018</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="2">23</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Combined scheduling and control /</subfield><subfield code="c">edited by John D. Hedengren, Logan Beal.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[Place of publication not identified] :</subfield><subfield code="b">MDPI AG - Multidisciplinary Digital Publishing Institute,</subfield><subfield code="c">2018.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (143 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on: online resource; title from PDF information screen (MDPI AG - Multidisciplinary Digital Publishing Institute, viewed February 20, 2023.).</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Solving the problem of intersection crossing for autonomous vehicles is a challenging task due to combined combinatoric and dynamical control decisions. To reduce the complexity of the computations and distribute the resulting global optimization problem, we propose a combined scheduling-control method. Thereby, in this paper, we focus on the formulation of a resource-constrained-project-scheduling problem (RCPSP) to solve the combinatoric decision, i.e. the order in which vehicles cross an intersection area in a central coordination unit. This problem considers control decisions from the vehicles, which are computed using model predictive control (MPC) laws. In turn, the resulting scheduling solution is incorporated again in local vehicle MPC problems, which negotiate among each other to find a dynamically feasible solution. This seamless combination of scheduling and control results in efficient solutions, which is illustrated using numerical simulation and the results are compared with a first-come-first-served (FCFS) strategy.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Problem solving</subfield><subfield code="x">Data processing.</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-03842-805-1</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hedengren, John D.,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Beal, Logan,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-03-01 00:20:30 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2018-04-07 19:23:49 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&amp;portfolio_pid=5337867370004498&amp;Force_direct=true</subfield><subfield code="Z">5337867370004498</subfield><subfield code="8">5337867370004498</subfield></datafield></record></collection>