JP2012243291A - Conveyance vehicle system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a conveyance vehicle system capable of efficiently allocating conveyance requests to respective conveyance vehicles.SOLUTION: The conveyance vehicle system comprises a one-way route 105 provided along a plurality of stations 120, a plurality of trucks 140, and a controller 110. The controller 110 includes a request notification part 112 for notifying the plurality of trucks 140 of a plurality of conveyance requests. Each of the plurality of trucks 140 includes a request acquisition part 142 for receiving the plurality of conveyance requests, a reception part 144 for receiving preceding vehicle information indicating the conveyance request scheduled to be executed by a preceding conveyance vehicle among the plurality of conveyance requests from the preceding conveyance vehicle, a determination part 146 for determining an execution request which is the conveyance request to be executed by the conveyance vehicle from the at least one conveyance request that the conveyance vehicle can execute among the plurality of conveyance requests specified by referring to the preceding vehicle information, and a transmission part 148 for transmitting information indicating the execution request to a subsequent conveyance vehicle.

Description

  The present invention relates to a transport vehicle system including a one-way route and a plurality of transport vehicles traveling along the route.

  Conventionally, there is a transport vehicle system including a one-way route and a plurality of transport vehicles traveling along the route. In such a transport vehicle system, a plurality of stations are arranged along the route, and each transport vehicle transports packages between the stations in response to a transport request from a host controller, for example.

  In such a transport vehicle system, for example, a case is assumed in which packages placed at each of a plurality of continuously arranged stations are received by a plurality of transport vehicles and transported.

  In other words, it is assumed that each of a plurality of transport requests corresponding to these cargo transport operations is assigned to one of a plurality of transport vehicles.

  In this case, from the viewpoint of improving work efficiency, it is generally performed to assign a transfer request corresponding to a station corresponding to the arrangement order of the plurality of transfer vehicles to each of the plurality of transfer vehicles.

  In order to make such an assignment, the host controller checks the arrangement order, positions, work contents, etc. of a plurality of transport vehicles under its control, and based on the confirmation results, Allocate a transport request.

  A technique for assigning a transport request to a transport vehicle by such a host controller is also disclosed (see, for example, Patent Document 1).

  According to the tracked cart system described in Patent Literature 1, when a cart that allocates a loading command to an empty cart in a predetermined area on the upstream side from each station and a cart that can execute the allocation command more efficiently appears, Change the assignment. By such a process, for example, the average travel distance of the cart until loading can be shortened.

JP 2002-6951 A

  However, conventionally, for example, in order to change the transport request for a plurality of transport vehicles so that the loading efficiency of each transport vehicle is improved, the host controller constantly monitors the position and state of each transport vehicle. There is a need.

  Therefore, for example, problems such as communication errors and response delays may occur due to the fact that each transport vehicle is moving at high speed.

  There are also junctions and branching points on the route traveled by each transport vehicle. Thereby, replacement occurs in the order of arrangement of the transport vehicles. As a result, the host controller needs to assign a transport request to each transport vehicle again in consideration of the new arrangement order of the transport vehicles.

  An object of the present invention is to provide a transport vehicle system including a plurality of transport vehicles in consideration of the above-described conventional problems, and capable of efficiently assigning a transport request to each transport vehicle. To do.

  In order to solve the above-described conventional problems, a transport vehicle system according to an aspect of the present invention includes a one-way route provided along a plurality of stations, a plurality of transport vehicles that travel along the route, A transport vehicle system comprising a controller that controls a plurality of transport vehicles, wherein the controller has a request notification unit that notifies the plurality of transport vehicles of a plurality of transport requests corresponding to the plurality of stations, Each of the plurality of transport vehicles includes a request acquisition unit that receives the plurality of transport requests, and a preceding transport vehicle that is a transport vehicle that is one forward of the transport vehicle. A receiving unit that receives the preceding vehicle information indicating the transportation request that the transportation vehicle is scheduled to execute, and the transportation vehicle that is specified by referring to the preceding vehicle information and that can be executed among the plurality of transportation requests 1 Less than A determination unit that determines an execution request that is a transfer request to be executed by the transport vehicle, and information indicating the execution request that is determined by the determination unit, one rear of the transport vehicle. A transmission unit that transmits to a subsequent conveyance vehicle that is a conveyance vehicle.

  According to this configuration, each of the plurality of transport vehicles has a function of assigning any of the plurality of transport requests notified from the controller to the transport vehicle.

  For example, a transport request (execution request) to be executed by the transport vehicle is determined from the remainder of the transport requests other than the transport request scheduled to be executed by the preceding transport vehicle. Further, information indicating which conveyance request is determined as an execution request is transmitted to the succeeding conveyance vehicle.

  That is, each of the plurality of transport vehicles can select a transport request to be executed by itself from the top in the order of arrangement in the one-way direction, from among the plurality of transport requests given from the host controller.

  Therefore, it is not necessary for the controller to know the position of each transport vehicle, and only by notifying the plurality of transport vehicles of the plurality of transport requests, the assignment of the plurality of transport requests to the transport vehicles. Is executed properly.

  Thus, the conveyance vehicle system of this mode is a conveyance vehicle system provided with a plurality of conveyance vehicles, and can efficiently allocate conveyance work to each conveyance vehicle.

  In the transport vehicle system according to an aspect of the present invention, the transmission unit may further transmit the preceding vehicle information received by the reception unit to the subsequent transport vehicle.

  According to this configuration, for example, in addition to the transport request determined as the execution request in the transport vehicle, the transport request determined to be executed by the preceding transport vehicle can be notified to the subsequent transport vehicle.

  In addition, for example, even if the transport vehicle is executing another request or is scheduled to execute another request, the preceding transport vehicle cannot be involved in the allocation of the plurality of transport requests. The succeeding transport vehicle can be notified of the transport request determined to be executed.

  Thus, by notifying the succeeding transport vehicle of the transport request determined to be executed by the preceding transport vehicle, for example, the execution request determining process in the succeeding transport vehicle is made more efficient.

  Further, in the transport vehicle system according to one aspect of the present invention, the determination unit corresponds to a station arranged at the most downstream of the plurality of stations from the one or more executable transport requests. One transport request may be determined as the execution request.

  According to this configuration, each of the plurality of transport requests is selected and executed by one of the transport vehicles according to the arrangement order of the stations corresponding to the respective transport requests.

  As a result, for example, the entire transfer operation including a plurality of transfer requests and execution thereof is efficiently performed.

  Further, in the transport vehicle system according to one aspect of the present invention, each of the plurality of transport requests is associated with a different priority, and the determination unit includes the one or more executable transport requests. The transport request having the highest priority may be determined as the execution request.

  According to this configuration, each of the plurality of transport requests is selected and executed by one of the transport vehicles in descending order of priority.

  As a result, for example, the entire transfer operation including a plurality of transfer requests and execution thereof is efficiently performed.

  Further, in the transport vehicle system according to one aspect of the present invention, the determination unit further includes the reception unit information indicating that the preceding transport vehicle is scheduled to execute the same transport request as the execution request. If the request is received, the transport request determined as the execution request may be canceled.

  According to this configuration, after the execution request is once determined, for example, when another transfer vehicle that interrupts between the transfer vehicle and the preceding transfer vehicle determines to execute the same transfer request as the execution request. Even if it exists, the problem that the said conveyance request | requirement is selected redundantly is prevented.

  In addition, the present invention can also be realized as a method for assigning a transport request including a characteristic process executed by the transport vehicle system according to any one of the above aspects. In addition, the present invention can be realized as a program for causing a computer to execute each process included in the transfer request allocation method and as a recording medium on which the program is recorded. The program can be distributed via a transmission medium such as the Internet or a recording medium such as a DVD.

  ADVANTAGE OF THE INVENTION According to this invention, it is a conveyance vehicle system provided with a some conveyance vehicle, Comprising: The conveyance vehicle system which can perform the allocation of the conveyance operation | work with respect to each conveyance vehicle efficiently can be provided.

FIG. 1 is a diagram showing a configuration outline of a transport vehicle system according to an embodiment of the present invention. FIG. 2 is a block diagram showing the main functional configuration of the carriage in the embodiment of the present invention. FIG. 3 is a diagram illustrating an example of a result of the transfer request assignment process executed by each carriage in the embodiment of the present invention. FIG. 4 is a diagram showing a first example of the operation of a plurality of carriages in the embodiment of the present invention. FIG. 5 is a diagram showing a second example of the operation of the plurality of carriages in the embodiment of the present invention. FIG. 6 is a diagram showing a third example of the operation of the plurality of carriages in the embodiment of the present invention. FIG. 7 is a diagram showing a fourth example of the operation of the plurality of carriages in the embodiment of the present invention. FIG. 8 is a diagram showing a fifth example of the operation of the plurality of carriages in the embodiment of the present invention. FIG. 9 is a diagram illustrating a sixth example of the operation of the plurality of carriages according to the embodiment of the present invention. FIG. 10 is a diagram illustrating a seventh example of the operation of the plurality of carriages in the embodiment of the present invention. FIG. 11 is a diagram illustrating an eighth example of the operation of the plurality of carriages in the embodiment of the present invention. FIG. 12 is a diagram for describing a station group in the transport vehicle system according to the embodiment.

  A carrier system according to an embodiment of the present invention will be described with reference to the drawings.

  FIG. 1 is a diagram showing a schematic configuration of a transport vehicle system 100 according to an embodiment of the present invention.

  The transport vehicle system 100 includes a one-way route 105 provided along a plurality of stations 120, a plurality of carriages 140 that travel along the route 105, and a controller 110 that controls the plurality of carriages 140.

  The station 120 is a place where a package is delivered to and from the carriage 140. In FIG. 1, three stations 120 of ST [A], ST [B], and ST [C] are illustrated.

  The cart 140 is an example of a transport vehicle that transports luggage. In FIG. 1, three carts 140, which are a cart (α), a cart (β), and a cart (γ), are illustrated. These carts 140 travel along a one-way route 105.

  Note that the type of the carriage 140 is not limited to a specific type, and may be a tracked carriage such as an overhead traveling vehicle or an automatic guided vehicle that travels on the floor.

  That is, the route 105 is specifically configured by a rail that guides the traveling of the carriage 140, a passage that the carriage 140 travels, or the like. Further, the route 105 is one-way from the right to the left in FIG. 1, and the carriage 140 cannot overtake the other carriages 140 on the route 105.

  The controller 110 includes a request notification unit 112 that notifies a plurality of transport vehicles of a plurality of transport requests corresponding to the plurality of stations 120.

  For example, the request notifying unit 112 may change the load placed on each of the three stations 120 (ST [A] to [C]) with respect to the three carts 140 (carts (α) to (γ)). The request to carry to the station 120 is notified.

  That is, three transport requests corresponding to ST [A], ST [B], and ST [C] are notified to the cart (α), the cart (β), and the cart (γ).

  Each of these trolleys 140 has a function of determining a transport request to be executed by itself from the notified three transport requests in cooperation with the other trolleys 140.

  FIG. 2 is a block diagram showing a main functional configuration of the carriage 140 in the embodiment of the present invention.

  The main functional configuration of the carriage 140 in the embodiment and the basic processing contents of each functional block will be described with reference to FIG.

  The carriage 140 includes a request acquisition unit 142, a reception unit 144, a determination unit 146, and a transmission unit 148.

  The request acquisition unit 142 acquires a plurality of transport requests transmitted from the controller 110. For example, as illustrated in FIG. 2, the request acquisition unit 142 acquires three transport requests corresponding to ST [A] to [C].

  Note that “Lv3”, “Lv2”, and “Lv1” shown in FIG. 2 are information indicating priorities associated with the respective transport requests, and are prioritized in the order of “Lv1”, “Lv2”, and Lv3. The degree will be higher.

  That is, for these plurality of transport requests, the transport request corresponding to ST [A] (hereinafter referred to as “transport request [A]”) has the highest priority, and then the transport request corresponding to ST [B] ( Hereinafter, the priority of “transport request [B]” is high, and the transport request corresponding to ST [C] (hereinafter referred to as “transport request [C]”) has the lowest priority. ing.

  In the present embodiment, when a plurality of transport requests are transmitted from the controller 110, the priority of each transport request is transmitted together with these transport requests.

  Moreover, in this Embodiment, each trolley | bogie 140 determines to perform the conveyance request | requirement with the highest priority in the 1 or more conveyance request | requirement which can carry out itself.

  Although details are omitted, the transport request transmitted from the controller 110 includes other information necessary for executing the transport request, such as a transport destination of the package.

  The receiving unit 144 receives preceding vehicle information indicating a transportation request that the preceding vehicle is scheduled to execute, from among the plurality of transportation requests, from the preceding vehicle that is the front carriage 140 one ahead of the cart 140.

  As shown in FIG. 2, for example, the receiving unit 144 receives the preceding vehicle information indicating “[A]” from the preceding vehicle. Thereby, in the said trolley | bogie 140, it is confirmed that a preceding trolley performs conveyance request [A].

  The determination unit 146 is a transport request executed by the cart 140 out of one or more transport requests that can be executed by the cart 140 among the plurality of transport requests specified by referring to the preceding vehicle information. Determine an execution request.

  For example, when the preceding vehicle information indicates “[A]”, the determination unit 146 specifies the transport request [B] and the transport request [C] as one or more executable transport requests, and among these, priority is given. A high conveyance request [B] is determined as an execution request.

  The transmission unit 148 transmits information indicating the execution request determined by the determination unit 146 to a subsequent vehicle that is one vehicle behind the vehicle 140.

  For example, when the transport request [B] is determined as the execution request, the transmission unit 148 transmits information indicating “[B]” to the subsequent carriage. In the present embodiment, the preceding vehicle information “[A]” is also transmitted to the subsequent vehicle.

  As a result, it is confirmed that two of the three transport requests transmitted from the controller 110 (transport request [A], transport request [B]) have been assigned to the other carts 140 in the subsequent cart. . As a result, in the succeeding carriage, the remaining transport request [C] is determined as an execution request.

  Note that the transmission unit 148 may not transmit the preceding vehicle information to the subsequent vehicle. For example, as in the present embodiment, it is assumed that the priority is associated with each transport request, and the subsequent vehicle receives the preceding vehicle information indicating only “[B]”.

  In this case, since the priority of the transport request [B] is “Lv2” in the subsequent carriage, it can be determined that the transport request corresponding to the priority of “Lv2” or higher has already been assigned.

  That is, in the succeeding carriage, it can be determined that only the transport request [C] associated with “Lv1” can be executed, and as a result, the transport request [C] can be determined as an execution request.

  Further, for example, the frequency used for wireless transmission of the information is adjusted so that the information indicating the execution request is received only by one succeeding carriage. Alternatively, the information indicating the execution request can be transmitted only to one succeeding carriage by transmitting the information using infrared rays having high directivity.

  A specific example of information processing and operation of the plurality of carriages 140 in the transport vehicle system 100 having the above configuration will be described with reference to FIGS.

  FIG. 3 is a diagram illustrating an example of a transfer request allocation result executed by each carriage 140 in the embodiment of the present invention.

  As described above, the priority of the transport request [A], the transport request [B], and the transport request [C] is “Lv3”, “Lv2”, and “Lv1” in this order, and the transport request [A ] Has the highest priority, and the transport request [C] has the lowest priority.

  That is, the priority of each of the plurality of transport requests is set higher as the position of the corresponding station 120 is more downstream.

  Each of the plurality of carriages 140 assigns a transport request having a high priority to itself in order from the head in the traveling direction.

  Thereby, work (loading) at the plurality of stations 120 by the plurality of carriages 140 can be performed, for example, at the same time, and the efficiency of the entire transfer work can be improved.

  For example, as shown in FIG. 3, when the transport requests [A] to [C] are assigned to the carts (α) to (γ), the carts (α) to (γ) correspond to each other almost simultaneously. The receipt (loading) of the package from the station 120 can be executed.

  In this embodiment, the carts 140 can cooperate with each other to execute transfer request assignments that improve the overall efficiency of the transfer work.

  FIG. 4 is a diagram showing a first example of the operation of the plurality of carriages 140 in the embodiment of the present invention.

  In the example shown in FIGS. 4 to 11, a plurality of transfer requests (transfer request [A], transfer request [B], and transfer request [C]) shown in FIG. It assumes the state that has been notified.

  Under such an assumption, the top carriage (α) is determined to execute the transport request [A] having the highest priority, and “[A]” is used as information indicating the transport request [A] scheduled to be executed. Is transmitted to the following vehicle (β).

  Since the carriage (β) only needs to be able to identify the transport requests that can be executed by itself, the carriage (α) can obtain information from the three transport requests excluding the transport requests that it plans to execute, that is, “[ Information indicating B] and [C] '' may be transmitted to the carriage (β) as preceding vehicle information.

  The carriage (β) specifies the transport request [B] and the transport request [C] as transport requests that can be executed by itself, and requests execution of the transport request [B] having the highest priority from these. Determine as.

  FIG. 5 is a diagram illustrating a second example of the operation of the plurality of carriages 140 according to the embodiment of the present invention.

  As shown in FIG. 5, the cart (β) is in a state where a load is loaded, and a request to carry the load to ST [Z] arranged downstream of ST [A] is being executed. Suppose.

  In this case, the carriage (β) receives the preceding vehicle information “[A]” from the carriage (α), which is the preceding carriage, but the ST [Z], which is the unloading destination, It is downstream of ST [B] and ST [C] corresponding to the transport request remaining as a selected branch in the transport request.

  Therefore, the carriage (β) is not involved in the allocation of the three transport requests, and directly transfers the preceding vehicle information “[A]” received from the carriage (α) to the carriage (γ).

  That is, the transmission unit 148 of the carriage (β) transmits the preceding vehicle information “[A]” received by the receiving unit 144 to the carriage (γ) that is the subsequent carriage.

  As a result, the carriage (γ) identifies the transport request [B] and the transport request [C] as transport requests that can be executed by itself, and the transport request [B] having the highest priority among these is requested. Is determined as an execution request.

  In this way, in the transport vehicle system 100, there is a cart 140 that cannot participate in a plurality of transport requests transmitted from the controller 110 at that time, for example, because a transport request is already being executed in the series of carts 140. In such a case, the following processing occurs.

  That is, the preceding vehicle information transmitted to the cart 140 passes through the cart 140 and reaches the cart 140 that can be involved in the plurality of transport requests behind the cart 140. Thereby, in the trolley | bogie 140 which received the preceding vehicle information, determination of an execution request | requirement is performed appropriately.

  Further, even if the leading carriage (α) cannot participate in the plurality of transport requests, the following processing occurs. That is, the carriage (β) reaches ST [C], for example, by not transmitting the preceding vehicle information indicating any one of the plurality of conveyance requests to the carriage (β). Until then, the transport request [A] having the highest priority among the plurality of transport requests can be determined as the execution request.

  FIG. 6 is a diagram showing a third example of the operation of the plurality of carriages 140 according to the embodiment of the present invention.

  As shown in FIG. 6, the cart (β) is in a state in which a load is loaded, and a request to carry the load to ST [Z] arranged upstream of ST [C] is being executed. Suppose.

  In this case, the carriage (β) receives the preceding vehicle information “[A]” from the carriage (α) that is the preceding carriage, and the ST [Z] that is the unloading destination is It is upstream of ST [B] and ST [C] corresponding to a transport request remaining as a selected branch in one transport request.

  Accordingly, the carriage (β) can execute the transport request [B] or the transport request [C] after the cargo loaded at that time is unloaded at ST [Z]. That is, the carriage (β) specifies the transport request [B] and the transport request [C] as executable transport requests, and executes the transport request [B] having the highest priority from these. Determine as.

  The carriage (β) further transmits information indicating “[A], [B]” as preceding vehicle information for the carriage (γ) that is the subsequent carriage. The carriage (γ) determines the transport request [C] as an execution request based on the preceding vehicle information.

  FIG. 7 is a diagram showing a fourth example of the operation of the plurality of carriages 140 according to the embodiment of the present invention.

  As shown in FIG. 7, the carriage (β) is arranged along a branched path 105 (vertical path 105 in FIG. 7) branched from the main path 105 (horizontal path 105 in FIG. 7). Assume that the transport request [D] corresponding to ST [D] is determined as an execution request.

  That is, it is assumed that the transport request [D] has already been assigned to the carriage (β).

  In this case, the carriage (β) cannot participate in the three transport requests. Therefore, when the preceding vehicle information “[A]” is received from the preceding carriage (α), the preceding vehicle information “[A]” is transferred as it is to the cart [γ] as the subsequent cart.

  FIG. 8 is a diagram showing a fifth example of the operation of the plurality of carriages 140 according to the embodiment of the present invention. FIG. 8 specifically shows the operation of each carriage 140 after the state shown in FIG.

  In other words, the carriage [γ] receives the preceding vehicle information “[A]”, thereby determining the transport request [B] as an execution request, and sends the following vehicle information to the carriage (δ), which is the subsequent carriage, as “ Information indicating [A], [B] "is transmitted.

  As a result, the carriage (δ) identifies the transport request [C] as an executable transport request, and determines this transport request [C] as an execution request.

  By performing the above information processing in each carriage 140, as shown in FIG. 8, each of the conveyance request [A], the conveyance request [B], and the conveyance request [C] is a carriage (α). , Trolley (γ), and trolley (δ). That is, the plurality of transport requests are appropriately executed by the carriage 140.

  As described above, as shown in FIGS. 5 to 8, in the transport vehicle system 100, there are carts 140 that cannot participate in a plurality of transport requests transmitted from the controller 110 at that time in the series of carts 140. Even in this case, the plurality of transport requests are efficiently assigned to one of the carts 140 and executed.

  In addition, a new cart 140 may be added to the series of carts 140 notified of the plurality of transport requests before the work corresponding to the plurality of transport requests is completed, such as the route 105 that joins the main route 105. Conceivable.

  Even in such a case, with the transport vehicle system 100 of the present embodiment, each transport request is efficiently assigned to one of the carts 140.

  FIG. 9 is a diagram illustrating a sixth example of the operation of the plurality of carriages 140 according to the embodiment of the present invention.

  As shown in FIG. 9, the carriage (γ) enters the main route 105 from the route 105 (vertical route 105 in FIG. 7) that joins the main route 105 (horizontal route 105 in FIG. 7). Assume that

  Here, at the time shown in FIG. 9, the carriage (α) determines the transport request [A] having the highest priority as an execution request, and as a result, the carriage (β) has the next priority as described above. A high conveyance request [B] is determined as an execution request.

  Further, the carriage (γ) is executing a transport request for transporting the cargo loaded on itself to ST (C).

  FIG. 10 is a diagram illustrating a seventh example of the operation of the plurality of carriages 140 according to the embodiment of the present invention. Specifically, FIG. 10 shows a first example of the operation of each carriage 140 after the state shown in FIG.

  When the cart (γ) joins the main route 105, as shown in FIG. 10, the cart (γ) may be connected after the cart (β). In this case, the cart (α) executes the transport request [A] as scheduled, and the cart (β) also executes the transport request [B] as scheduled.

  However, when the carriage (γ) interrupts between the carriage (α) and the carriage (β), the readjustment of the transfer request is performed.

  FIG. 11 is a diagram illustrating an eighth example of the operation of the plurality of carriages 140 according to the embodiment of the present invention. Specifically, FIG. 11 shows a second example of the operation of each carriage 140 after the state shown in FIG.

  As shown in FIG. 11, it is assumed that the carriage (γ) is interrupted between the carriage (α) and the carriage (β) when the carriage (γ) joins the main path 105.

  In this case, the carriage (γ) receives the preceding vehicle information “[A]” from the carriage (α), so that the carriage request [B] and the carriage request [C] can be executed as a carriage request that can be executed by itself. And the transport request [B] having the highest priority is determined as an execution request.

  As a result, the carriage (β) receives the preceding vehicle information “[A], [B]” from the preceding carriage (γ).

  In other words, in the carriage (β), the reception unit 144 receives the preceding vehicle information indicating that the carriage (γ) that is the preceding carriage is scheduled to execute the same transport request [B] as the execution request determined by itself. To do.

  That is, from the cart (β), the transport request [B] is a transport request that cannot be executed afterwards. As a result, the determination unit 146 of the carriage (β) cancels the transport request [β] determined as the execution request.

  Further, as shown in FIG. 11, if the position of the carriage (β) at that point in time is upstream of ST [C], the determination unit 146 of the carriage (β) responds with a transport request that can be executed at that point. A certain transport request [C] is determined as an execution request.

  As described above, even when a new carriage 140 is added to the series of carriages 140 that perform the conveyance work in response to the plurality of conveyance requests transmitted from the controller 110, each of the plurality of conveyance requests. The allocation process to the carriages 140 is appropriately executed in each carriage 140. That is, the transfer request is efficiently allocated to each carriage 140.

  As described above, in the transport vehicle system 100 of the present embodiment, each of the plurality of carriages 140 is transported by itself by referring to the preceding vehicle information when a plurality of transport requests are notified. The request can be determined appropriately.

  At that time, the leading carriage 140 of the plurality of carriages 140 has a predetermined timing (for example, the station 120 located at the most upstream of the plurality of stations 120 corresponding to the plurality of transport requests). By not receiving the preceding vehicle information (by reaching a point upstream by a predetermined distance from the vehicle), among the plurality of transport requests, for example, the transport request having the highest priority can be determined as an execution request. it can.

  In addition, there are cases where there are trolleys 140 that cannot be involved in the plurality of transport requests among the plurality of trolleys 140 and when new trolleys 140 are added to the plurality of trolleys 140. However, as described above, the plurality of transport requests are appropriately assigned.

  Specifically, any one of the carts 140 performs processing such as transfer of preceding vehicle information or cancellation of an execution request, so that the plurality of transport requests can be efficiently and appropriately performed. Assigned to.

  In addition, since each cart 140 can assign a plurality of transfer requests notified from the controller 110 in this way, the controller 110 constantly monitors the position and state of each cart 140, for example. There is no need to keep it. As a result, the processing of the transport vehicle system 100 as a whole is made efficient.

  The transport vehicle system of the present invention has been described above based on the embodiments. However, the present invention is not limited to the above embodiment. Unless it deviates from the gist of the present invention, various modifications conceived by those skilled in the art have been made in the present embodiment, or forms constructed by combining a plurality of the above-described constituent elements are within the scope of the present invention. include.

  For example, the priority associated with each transport request need not be transmitted from the controller 110. For example, the carriage 140 may determine the priority of each conveyance request.

  Here, it is assumed that the carriage 140 receives the above three transfer requests [A] to [C] from the controller 110 without giving priority.

  In this case, for example, the determination unit 146 has a map (not shown) stored in the carriage 140 that indicates the position of the station 120 (that is, ST [A], ST [B], and ST [C]) corresponding to each transport request. To identify).

  Thereby, the determination unit 146 can specify the arrangement order of ST [A], ST [B], and ST [C] from downstream to upstream.

  As a result, the determination unit 146 can determine that the transport request [A] corresponding to the most downstream station 120 among the transport requests [A] to [C] should be determined as an execution request.

  In other words, even if each carriage 140 has a common criterion for determining such execution requests, as in the above-described embodiment, each transfer request is executed in order from the one to be executed with priority. Assigned to the cart 140.

  In the present embodiment, the controller 110 explicitly issues a transport request for each station 120 as shown in FIG.

  However, the controller 110 may collectively notify requests equivalent to a plurality of transport requests without using the individual information ([A], etc.) for each station 120.

  FIG. 12 is a diagram for describing a station group in the transport vehicle system 100 according to the embodiment.

  For example, as shown in FIG. 12, a case is assumed in which a station group including a plurality of stations 120 arranged in succession is defined.

  In FIG. 12, three of the first station group 201, the second station group 202, and the third station group 203 are shown.

  In this case, each carriage 140 stores station group information indicating the correspondence between these station groups and the station 120.

  In this way, when the station group is defined, the controller 110, for example, sends a transport request including information indicating the first station group 201 to a series of carts 140 traveling upstream from the first station group 201. Notice.

  In this case, each of the series of carriages 140 identifies the stations 120 (ST [A], ST [B],...) Included in the first station group 201 by referring to the station group information. Can do.

  In other words, each carriage 140 can recognize that a plurality of transport requests such as a transport request [A], a transport request [B],.

  Each carriage 140 further uses, for example, as described above, the priority of each transport request (transport request [A]) by using a criterion that the priority is higher as the station 120 corresponding to each transport request is downstream. > Transport request [B]>...) Can be specified.

  As described above, the controller 110 may collectively notify a request equivalent to a plurality of transport requests without using the individual information of the station 120. Even in this case, each carriage 140 cooperates. Thus, efficient allocation of the plurality of transport requests can be performed.

  The conveyance vehicle system of the present invention is a conveyance vehicle system provided with a plurality of conveyance vehicles, and is a conveyance vehicle system which can perform efficiently assigning conveyance work to each conveyance vehicle. Therefore, it is useful as a transport vehicle system for transporting luggage in factories and distribution warehouses.

DESCRIPTION OF SYMBOLS 100 Carrier vehicle system 105 Path | route 110 Controller 112 Request notification part 120 Station 140 Car 142 Request acquisition part 144 Reception part 146 Determination part 148 Transmission part 201 1st station group 202 2nd station group 203 3rd station group

Claims (5)

A one-way route provided along a plurality of stations, a plurality of carrier vehicles that travel along the route, and a controller that controls the plurality of carrier vehicles,
The controller has a request notification unit that notifies the plurality of transport vehicles of a plurality of transport requests corresponding to the plurality of stations,
Each of the plurality of transport vehicles is
A request acquisition unit for receiving the plurality of transport requests;
A receiving unit that receives, from a preceding transport vehicle that is a transport vehicle in front of the transport vehicle, a preceding vehicle information that indicates a transport request that the preceding transport vehicle plans to execute among the plurality of transport requests;
An execution request, which is a transport request executed by the transport vehicle, is selected from one or more transport requests that can be executed by the transport vehicle among the plurality of transport requests specified by referring to the preceding vehicle information. A decision part to decide;
A transport vehicle system, comprising: a transmission unit that transmits information indicating the execution request determined by the determination unit to a subsequent transport vehicle that is one transport vehicle behind the transport vehicle. The transport vehicle system according to claim 1, wherein the transmission unit further transmits the preceding vehicle information received by the reception unit to the subsequent transport vehicle. The determination unit determines, as the execution request, one transfer request corresponding to a station arranged at the most downstream of the plurality of stations from the one or more executable transfer requests. Or the conveyance vehicle system of 2. Each of the plurality of transport requests is associated with different priorities,
The transport vehicle system according to claim 1, wherein the determination unit determines a transport request having the highest priority among the one or more executable transport requests as the execution request. The determination unit further includes a transport request determined as the execution request when the preceding vehicle information indicating that the preceding transport vehicle is scheduled to execute the same transport request as the execution request is received by the reception unit. The conveyance vehicle system of any one of Claims 1-4.

Images