EK
E.A. Kemmeren
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
2 records found
1
Introducing flexibility in any-start-time safe interval path planning
A case study on the Dutch railway network
During the daily operation of the railway network, ProRail is responsible for handling delays and planning ad hoc train movements. Train handling documents aid the traffic controllers in common situations. But when multiple trains are delayed, and these documents do not apply, they are left to their own expertise.
In this thesis, we introduce FlexSIPP, an algorithm to plan or replan agents in an existing multi-agent plan. FlexSIPP builds upon the prior works of any-start-time safe interval path planning, where the current routes of the agents are seen as moving obstacles. FlexSIPP loosens this restriction by introducing flexibility: the ability for an agent to delay its plan while minimally impacting other agents.
This algorithm is evaluated on the Dutch railway network. By finding tipping points, that is, the moment it is better to switch the order of two trains on the track to minimize the delay, we can recreate train handling documents. We show that FlexSIPP finds the same solutions within a minute in the case that no other trains are delayed. This implies that FlexSIPP is also able to aid traffic controllers in the case that other trains are delayed ...
In this thesis, we introduce FlexSIPP, an algorithm to plan or replan agents in an existing multi-agent plan. FlexSIPP builds upon the prior works of any-start-time safe interval path planning, where the current routes of the agents are seen as moving obstacles. FlexSIPP loosens this restriction by introducing flexibility: the ability for an agent to delay its plan while minimally impacting other agents.
This algorithm is evaluated on the Dutch railway network. By finding tipping points, that is, the moment it is better to switch the order of two trains on the track to minimize the delay, we can recreate train handling documents. We show that FlexSIPP finds the same solutions within a minute in the case that no other trains are delayed. This implies that FlexSIPP is also able to aid traffic controllers in the case that other trains are delayed ...
During the daily operation of the railway network, ProRail is responsible for handling delays and planning ad hoc train movements. Train handling documents aid the traffic controllers in common situations. But when multiple trains are delayed, and these documents do not apply, they are left to their own expertise.
In this thesis, we introduce FlexSIPP, an algorithm to plan or replan agents in an existing multi-agent plan. FlexSIPP builds upon the prior works of any-start-time safe interval path planning, where the current routes of the agents are seen as moving obstacles. FlexSIPP loosens this restriction by introducing flexibility: the ability for an agent to delay its plan while minimally impacting other agents.
This algorithm is evaluated on the Dutch railway network. By finding tipping points, that is, the moment it is better to switch the order of two trains on the track to minimize the delay, we can recreate train handling documents. We show that FlexSIPP finds the same solutions within a minute in the case that no other trains are delayed. This implies that FlexSIPP is also able to aid traffic controllers in the case that other trains are delayed
In this thesis, we introduce FlexSIPP, an algorithm to plan or replan agents in an existing multi-agent plan. FlexSIPP builds upon the prior works of any-start-time safe interval path planning, where the current routes of the agents are seen as moving obstacles. FlexSIPP loosens this restriction by introducing flexibility: the ability for an agent to delay its plan while minimally impacting other agents.
This algorithm is evaluated on the Dutch railway network. By finding tipping points, that is, the moment it is better to switch the order of two trains on the track to minimize the delay, we can recreate train handling documents. We show that FlexSIPP finds the same solutions within a minute in the case that no other trains are delayed. This implies that FlexSIPP is also able to aid traffic controllers in the case that other trains are delayed
Visible Light Communication (VLC) has seen drastic improvements in recent years, one approach uses active light sources like LEDs, switching them at hight speeds to send data. Another approach uses the fundamental characteristics of liquid crystals (birefringence and thickness) to transmit data to a single pixel receiver. These characteristics allow for alterations in the color of the light. Little power is being used to transmit this data in comparison with using LEDs, and is significant faster than switching the LCs fully on or off like other research has done. This paper proposes an algorithm to decode the data transmitted by LCs with a high-end smartphone instead of the single pixel receiver. This algorithm called ChromaCam has real time transmitter detection and decoding of data. A demonstration is shown using a prototype, achieving data rates of 31 bits per second.
...
Visible Light Communication (VLC) has seen drastic improvements in recent years, one approach uses active light sources like LEDs, switching them at hight speeds to send data. Another approach uses the fundamental characteristics of liquid crystals (birefringence and thickness) to transmit data to a single pixel receiver. These characteristics allow for alterations in the color of the light. Little power is being used to transmit this data in comparison with using LEDs, and is significant faster than switching the LCs fully on or off like other research has done. This paper proposes an algorithm to decode the data transmitted by LCs with a high-end smartphone instead of the single pixel receiver. This algorithm called ChromaCam has real time transmitter detection and decoding of data. A demonstration is shown using a prototype, achieving data rates of 31 bits per second.