Path blockage determination system and method

• US 4,764,873 A
• Filed: 02/13/1987
• Issued: 08/16/1988
• Est. Priority Date: 02/13/1987
• Status: Expired due to Fees

• Current Assignee: Dalmo Victor Incorporated
• Original Assignee: Dalmo Victor Incorporated DIV of The Singer Company
• Inventors: Libby, Vibeke
• Primary Examiner(s): Smith, Jerry
• Assistant Examiner(s): NOT, DEFINED
• Application Number:
  US07/014,368
• Time in Patent Office: 550 Days
• Field of Search: 364/474, 364/513, 364/461
• US Class Current: 701/301
• CPC Class Codes: B25J 9/1676 Avoiding collision or forbidden zones
• CPC Class Codes: G06F 30/18 Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling circuit design at the physical level G06F30/39; network planning tools for wireless communication networks H04W16/18

Abstract

A path analyzer for determining if a specified path is blocked by a given obstacle. A programmable comparator simultaneously compares each of the coordinates of a specified point in N dimensional space with two coordinate ranges: (1) the range defined by the minimum and maximum values of the coordinate for a specified obstacle, and (2) the range of values of that coordinate which are outside and one one side of the obstacle. As a result, the programmable comparator generates a 2N bit map signal denoting, for each coordinate, whether the specified point is within each of the two ranges.

The analyzer presents to the programmable comparator the coordinates of the starting point and the end point of a specified path, and the programmable comparator responds by generating a starting point map signal and an end point map signal. A decoder then uses these starting point and end point map signals to determine whether the specified path is blocked, not blocked, or may be blocked by the specified obstacle.

In a preferred embodiment, the decoder is a read only memory which generates a path analysis signal indicating whether the specified path is blocked, not blocked, or may be blocked. Furthermore, if the path may be blocked, the path analysis signal specified the calculation needed to resolve whether the specified path is blocked. In some embodiments a slope comparator is used to perform the calculations specified by the decoder to resolve whether the specified path is blocked.

Claims

1. A path analyzer, comprising

programmable comparator means for simultaneously comparing each of the coordinates of a specified point in N dimensional space, where N is the number of coordinates used to define the location of each said point, with two coordinate ranges:

(1) the range of values within the range defined by the minimum and maximum values of said coordinate for a specified obstacle, and

(2) the range of values of said coordinate which are outside and on one side of said obstacle;

said programmable comparator generating a map signal, having 2N bits, denoting for each of said N coordinates whether the specified point is within each of said two ranges;

path denoting means for simultaneously presenting to said programmable comparator N coordinates of a specified starting point of a specified path in N-dimensional space so that said programmable comparator generates a starting point map signal, and for simultaneously presenting to said programmable comparator N coordinates of the end point of said specified path in N-dimensional space so that said programmable comparator generates an end point map signal; and

decoder means for decoding said starting point map signal and end point map signal and generating a path analysis signal which specifies one of three path conditions selected from the group comprising;

blocked (said specified path is blocked by said specified obstacle), unblocked (said specified path is not blocked by said specified obstacle), and may-be-blocked (said specified path may be blocked by said specified obstacle).

2. The path analyzer of claim 1, wherein said decoder means is a memory using said starting point map signal and end point map signal together as an address, the output of said memory being said path analysis signal.

3. The path analyzer of claim 1 or 2, wherein

when said decoder generates a path analysis signal indicating that said specified path may-be-blocked, said path analysis signal further specifies the calculation needed to determine whether said specified path is blocked by said obstacle.

4. The path analyzer of claim 3, further including

slope comparison means for comparing the slope of said path with the slope of a line defined by a specified one of the end points of said path and a specified point on the periphery of said obstacle, and for generating a slope comparison signal indicating whether said comparison passed a specified test;

and

processing means for supplying said slope comparison means with the coordinates of said starting and end points of said path, and the coordinates of a point on the periphery of said obstacle selected in accordance with said calculation indicated by said path analysis signal;

said processing means including means for receiving the comparison signal generated by said slope comparison means;

whereby said processing means can use said slope comparison means to perform the calculations necessary to determine if a path is blocked when said path analysis signal indicates that said path may be blocked.

5. In a method of determining whether a specified path is blocked by a specified obstacle, said path having specified first and second end points in N dimensional space, where N is the number of coordinates used to define the location of each said point, the steps comprising:

simultaneously comparing each of the coordinates of said first end point with two coordinate ranges;

(1) the range of values within the range defined by the minimum and maximum values of said coordinate for a specified obstacle, and

(2) the range of values of said coordinate which are outside and on one side of said obstacle,

and generating a first map signal, having 2N bits, denoting for each of said N coordinates whether said first end point is within each of said two ranges;

simultaneously comparing each of the coordinates of said second end point with said two coordinate ranges and generating a second map signal, having 2N bits, denoting for each of said N coordinates whether said second end point is within each of said two ranges;

decoding said first and second map signals in accordance with a predetermined decoding pattern and thereby generating a path analysis signal which specifies one of three path conditions selected from the group comprising;

blocked (said specified path is blocked by said specified obstacle), unblocked (said specified path is not blocked by said specified obstacle), and may-be-blocked (said specified path may be blocked by said specified obstacle).

6. The path analysis method of claim 5, wherein

when said path may-be-blocked, said decoding step includes the step of generating a signal that specifies a follow-up calculation for determining whether said specified path is blocked by said obstacle.

7. The path analysis method of claim 6, further including the step of performing said follow-up calculation, said performing step including the steps of:

selecting a point on the periphery of said obstacle in accordance with said specified follow-up calculation;

selecting a comparison test in accordance with said specified follow-up calculation; and

comparing the slope of said path with the slope of a line defined by a specified one of the end points of said path and said selected point on the periphery of said obstacle, and generating a slope comparison signal indicating whether said comparison passed said selected test.