Model track layout representation

• US 20040200934A1
• Filed: 04/30/2004
• Published: 10/14/2004
• Est. Priority Date: 01/17/2002
• Status: Active Grant

• Current Assignee: Liontech Trains LLC
• Original Assignee: Louis G. Kovach, II, Neil Young
• Inventors: Young, Neil, Kovach, Louis G. II
• Granted Patent: US 7,264,207 B2
• Time in Patent Office: Days
• US Class Current: 246/122A
• CPC Class Codes: A63H 19/24 Electric toy railways; Systems therefor

Abstract

A method and apparatus for determining a model vehicle layout by moving a vehicle around the track and noting when the vehicle passes track position detection elements. The vehicle can either detect the position detection elements, or the position detection elements can be sensors which detect the vehicle. By noting the order of the position detection elements as detected, and the direction of the vehicle, the layout of the track can be determined. In one embodiment, the position detection elements are sensors along the track which detect an emitted ID from the vehicle, and also detect the speed and direction of the vehicle. This information is then relayed to a control system. In another embodiment, the vehicle detects the position detection element, and relays this information, along with the train ID, speed and direction, to the control system. In another aspect of the invention, a particular type of vehicle at a particular location can be identified, and can be used to selectively operate accessories adjacent that portion of the track. The invention also can provide automated route generation, the route between A and B meeting input route parameters (e.g., backing into destination) can be automatically determined. Also, default accessory and switch selection can be automatically provided to a hand-held controller based on what the vehicle is approaching.

Claims

1. A method for organizing a representation of a model vehicle track layout comprising:

storing a plurality of block IDs corresponding to different sections of said track;

storing connected sections associated with each said block ID;

storing a representation of the arrangement of said connected sections in a manner that allows subsequent determination of loops, sidings and crossovers.

2. The method of claim 1 wherein said representation of the arrangement includes:

storing a first and second connection to a first side of each section corresponding to travel by a vehicle in a first specified direction; and

storing a first and second connection to a second side of each section corresponding to travel by said vehicle in a second specified direction.

3. The method of claim 2 wherein said first and second specified directions are clockwise and counterclockwise.

4. The method of claim 1 further comprising associating an indirect block with certain of said block IDs, said indirect block indicating a block that can not be traveled to, but which intersects a block such that a vehicle on said indirect block presents a collision risk.

5. The method of claim 2 wherein each of said sections is designated as one of a block, a switch and a crossover.

6. The method of claim 1 further comprising determining a loop in said track by examining said block IDs to locate a series of blocks connected in a first direction which concludes with a last block connecting to a first block.

7. The method of claim 1 further comprising determining a siding by examining said block IDs to locate connected sections of track which are connected to the same section at their respective ends.

8. The method of claim 1 further comprising:

determining an optimum route through said track IDs in accordance with user input specifications.

9. The method of claim 8 wherein said user input specifications include beginning and ending locations and one of longest route, shortest route and a route switching the direction of the vehicle at the ending location, all without affecting other vehicles.

10. The method of claim 9 wherein said shortest route is determined by iteratively examining all possible connections starting at a begging block ID, and terminating at an ending block ID, which satisfy a set of route parameters, then selecting an optimum route.