Routing methods for multiple geographical entities

US8386479B2 · kind B2 · utility

Assignees

• UNIVERSITY OF TORONTO · CA
• Technion Research & Development Foundation Limited · IL
• YISSUM RESEARCH DEVELOPMENT COMPANY OF THE HEBREW UNIVERSITY OF JERUSALEM LTD. · IL

Inventors

• Eliyahu Safra · Redlands, US
• Yaron Kanza · Fair Lawn, US
• Yehoshua Sagiv · Jerusalem, IL
• Yerach Doytsher · Raanana, IL

Key dates

• Filing date: Jul 9, 2008
• Grant date: Feb 26, 2013
• Expiry date: Jul 9, 2028

Classification

• Technology area (CPC G): Physics
• CPC primary: G06Q10/047
• WIPO field: IT methods for management
• WIPO sector: Electrical engineering

Abstract

Routing method for computing routes over uncertain geo-spatial data whereby only upon visiting the geographic entities it can be determined whether the needed service or product is actually provided and is adequate. When dealing with uncertain data, the returned route may need to go via several entities of the same type. Another routing method consists of finding an efficient and effective route from a starting point to an ending point going trough a predetermined number of objects, wherein each object represents a geographical entity of a unique type, and each object is selected from a distinct set of similar objects.