|
|
|
|
|
|
|
There are philosophers: they see things as they are, and they ask "Why?" And then there are inventors: they dream of things that never were, and they ask "Why not?" |
|
he Guidance System is the most complex part of all those computerized systems that keep the FLYWAY network operational. As the name implies, the Guidance System is supposed to guide the beamcars safely and efficiently through the maze of beams, from start to destination.This is a very technical page, intended for those actively involved in the steering and control of automatic vehicles. The process of "weaving" traffic is part of the Guidance System, and this is treated on a separate page. |
|
![]() |
|---|
|
There are in principle three different ways to run a system such as this:
FlyWay will use the Point-Synchronous system, but this is not as clearcut as might seem. The implementation of such a system, with the ambition that it should be able to grow painlessly, and without alterations, as the network grows and becomes more complex, is a daunting task. It requires a thorough knowledge of the theory behind automatically controlled transportation systems such as this. The object of this webpage is to dig into this, and see where we end up. |
Short Description of how it will be used by FlyWay
2) Requests for Timeslots:
3) Allocation of Timeslots:
|
4) Congestion:
If requests for slots from waiting cars are pouring in faster than the vehicles which are out and running can complete their journeys, it would be increasingly hard for the node computers to find an empty slot, and delays would generally increase in the beam network. Such queueing would then occur only on asynchronous beam segments, while on synchronous segments the traffic would run in a normal fashion. This would be a sign that the network is too small in regard to both the number of beamcars and to the traffic demand.
5) The need for Regional Computers:
6) Termination of beams:
Nor can they be re-classified as asynchronous beams at just any point. But this is just a computer-administrative definition. In reality, one treats such a situation as if there were a diverging node, where both the ensuing legs are asynchronous, and one leg is "virtual". But synchronous beams can form continuous loops, or both legs after a diverging node can be re-classified as asynchronous as mentioned (see figure 2:2, where the synchronous beam is blue) This last condition should reasonably be allowed to apply, since one of the ensuing legs after a diverging node can be re-classified as asynchronous.
![]() Figure 2:2: Terminating a synchronous beam |
![]() |
|
Looking at figure 3:2, we could regard the asynchronous parts as isolated "islands" (shown in yellow) joined together by synchronous beams. If in future there comes a need for more stations or nodes along these stretches of beams, new "yellow" (asynchronous) areas will appear. Now, this representation is a bit ambigious, because;
In figures 3:1, 3:2 and 3:4 we have depicted synchronous beams with blue and asynchronous beams with red. As figure 3:1 shows:
Similarly, figure 3:2 tries to show that:
The booking points (figure 3:3) should ideally be equi-distant from the weaving node control, since this makes it easier for the computer to calculate the weaving. But this point should also be as far away from the weaving node as possible, for the reason stated above. The decision where to place these points is better made in each individual case. In a closer look at the beams, figure 3:4 shows a blue (i.e. synchronous) trunk line, surrounded by station areas. For simplicity, only a one-way beam has been shown. Beamcars can reach the station area by leaving the trunk on a few places, whereupon they enter asynchronous beams. Likewise, when entering onto the beam, they will have to pass booking points and be alloted a timeslot by the node controller in charge. Note where (and why) the beam is blue resp. red! Since the beamcars could (and should!) stop here and there, the beams containing berths, parking areas and car buffering zones are of course asynchronous. But, to avoid chaos and ensure smooth rides, the internally connecting beams, as well as the beams joining this area with the surrounding world have to by under synchronous control.
Nodal Control and Regional Controls
The control of, and communications with, the beamcars on synchronous beams is done by the node computer at the node which the car is approaching Thus the blue beams actually "belong" to the (yellow) node controllers they are leading to, while traffic on the asynchronous beams inside the yellow areas are controlled by the regional computer to which the nodal (yellow) area belongs. Confusing? Yes, but logical, if you think it through. Figure 3:6 clarifies this matter somewhat. All lines leading up to a node are synchronous from the booking points to the node, and controlled by that node. After nodes B and D, the beams turn asynchronous and will be controlled by the regional computer. The beams after nodes A and C remain synchronous, and will thus remain under node computer control. But not by nodes A and C, but by the nodes that those beams are leading up to. So, this overlapping of yellow and grey areas (as shown in figure 3:5) is not a cause for conflict, because the functions of these computers are different. |
|
Here are simple examples of how it would work:
Figure 3:2
Figure 3:3
Figure 3:4
Figure 3:5
Figure 3:6 |
|---|
|
|
Figure 4:1 provides a simplified view of how the timeslots travel on (in this example) a circular synchronous beam, which is joined at som places by asynchronous beams. As explained elsewhere, the timeslots could be considerad as imaginary beam vehicles. A vehicle that joins from an asynchronous beam will fill a vacant slot, and a vehicle that leaves the synchronous beam will vacata a timeslot and make it available for another vehicle. So far, so good. But there are complicating factors: |
|
![]()
|
|---|
Clearly, travel speed cannot be constant everywhere and all the time in the synchronous beam network, if we are to make use of its full capacity. To set the speed limits everywhere equal to the lowest permitted speed would simplify the handling of the network, but it would be wasteful of capacity. Instead, the goal must be to eliminate or minimize as much as possible the factors that influence maximum allowed speed. The factors that influence speed on a synchronous beam segment are:
It could be that a small or empty vehicle catches up with a vehicle that for one of the reasons above moves slower. The second vehicle would then (of course) have to adopt the same speed as the vehicle ahead.
Figure 5:1
where: Since v will vary according to the factors listed above, and since required headway depends on vehicle speed (and a few other factors), timeslot generation at a node can vary considerably. If several weaving nodes are connected with synchronous beams (as in figure 5:1), there will be much communications overhead between these nodes in order to keep coordinated timeslot speeds, and probably quite a few "wasted" timeslots at high traffic times. This could be avoided by letting the traffic travel asynchronologically along som stretches between these nodes. This need becomes bigger as traffic grows. A succession of weaving nodes have the potential to, from time to time, create congestion-situations, where traffic cannot flow at top speed. If all the beams in figure 5:1 have the same traffic capacity, then it´s clear that confluent maximum traffic from nodes C and F can only move at half speed, due to the constraint on the beam between nodes B and A. The same applies to traffic joining up at node E. The successive confluences will then further reduce the overall speed, if the feeder traffic to each node is at or near capacity. This is of course primarily a design problem. But how do the node controllers deal with this? If this were an asynchronous network, the beamcars would regulate their own speeds up to the booking points before each node, where the node controllers would allot timeslots, thus keeping the traffic moving. But if all the beams are synchronous all the way, all the nodes would have to adjust their timeslot speeds to the speeds of the "downstream" nodes. This could be accomplished by the "downstream" nodes continually keeping the "upstream" nodes informed of their own timeslot speeds. Since this information travells and is processed much faster than the vehicles moves, this would conceivable enable the nodes to adjust slot-speed so that the vehicles to stay in their timeslots. This could be trimmed so that the system would rather let some empty slots slip by, than take the risk of trying to fill all slots. |
|
Just the same, there would need to be provisions for instances where beamcars cannot keep up with their timeslots, because they have other vehicles blocking the way. Trying to assign new timeslots to these vehicles would create an administrative mess! It would in such a case be better for the affected node to temporarily convert the beam to asynchronous mode, and then simply monitor traffic for an opportunity to reassert timeslot allotment to vehicles that have not yet passed the node´s booking points. As an example, node E loses control of its traffic, and converts the beam to asynchronous mode (depicted in red), and then informs node D about the situation. Node D should then assist node E in regaining control of its beams by slowing down timeslot speed. Since the real reason for beamcars not being able to stay in their slots is downstream congestion, this slowing down will help beamcars to stay in their slots.
Proposed solutions for FlyWayConsidering the listing in the foregoing chapter:
If this is not a satisfactory solution, one could split the beam and thus divide up the traffic load, as in example C. This would not reduce traffic capacity, and would have the chance of leading one of these beams along a different street. A permitted way to terminate synchronous beams, if loops (as in B) is not a good solution, is to use virtual divergent nodes as in example D. The non-existent arm is treated by the computer as if it were permanently blocked by queued cars. Since both arms are asynchronous, congestion is a situation that can be handled here. The beam section with 40 km/h. is, as in B, asynchronous. Example E shows yet another solution. Virtual weaving nodes will require booking points (B), where traffic speed is altered to adapt for the "virtual" traffic from the "virtual" arm. Since traffic speed increases at the right virtual node, it could properly be treated as a divergent node. But it really should not matter which kind of node this is.
|
|---|
|
|
This might sound simple, but the actual procedure, the handling of various contingencies and the possibility for various degrees of "intelligence" and forward planning in the merging process makes this a rather complicated task. We have therefore devoted a separate page for this. |
![]() |
Figure 6:1 |
|---|
|
![]() Figure 7:1Assuming that the length of beams for queued vehicles before the booking points is sufficiently long in both cases, one can see that in case A, the beamcars have much shorter distance in which to pick up speed than in case B. The node processor also has much shorter time to allocate timeslots in case A than in case B. Does that matter? Yes, as stated above, some cars might need 2 timeslots, and in case A, the node will be pretty "harried" to make that decision, since it won´t be told about that until the car in question has passed the booking point. One can conclude from this that, both at low traffic intensity and in congestion situations, both beamcars and nodes are best off with their booking points as far away as possible. As stated on other pages, the FlyWay® beamcars are intelligent enough to find their own way through the asynchronous network without outside communication, if need be. |
|
| Copyright © 2004, SwedeTrack System. | Last Updated: 2007-01-17 |
Webmaster |
This site is maintained by Johnson Consulting |
|---|