A system and method is provided that creates a multimodal transportation routing that originates using a road-based vehicle which then requires parking. Parking is not necessarily near the destination, but is determined based on user preferences and specification of the relative importance of speed of travel and monetary cost and/or safety. Other factors can also influence the route selection and comprise: parking availability, user preference for parking type, vehicle restrictions, maximum distance a user is willing to walk or bike and what types of public transportation a user is willing to use. Monetary factors include: fuel costs, parking costs, tolls, and public transportation costs.
Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
3. The method according to claim 2, wherein the assigned travel cost of the node is further responsive to a safety index of parking at the parking location, as well as a weighting function defining a relative contribution of the safety index to the travel cost.
4. The method according to claim 3, wherein the safety index reflects a level of theft or vandalism in the parking location.
A system and method for assessing parking location safety evaluates theft or vandalism risks at a parking location to enhance security. The method involves determining a safety index for a parking location, where the index quantifies the likelihood of theft or vandalism based on historical data, environmental factors, or real-time monitoring. The system may use sensors, surveillance cameras, or external databases to gather relevant data, such as past incidents, lighting conditions, or neighborhood crime rates. The safety index is then used to provide users with a risk assessment, allowing them to make informed decisions about where to park. Additionally, the system may offer recommendations for safer parking alternatives or suggest security measures, such as additional lighting or surveillance, to mitigate risks. The method may also integrate with navigation systems to guide users to lower-risk parking areas. By dynamically evaluating and communicating safety risks, the system helps reduce the likelihood of theft or vandalism, improving overall parking security.
5. The method according to claim 1, wherein the assigned travel cost of the edges is further responsive to a safety index of a location traversed by the leg, as well as a weighting function defining a relative contribution of the safety index to the travel cost.
6. The method according to claim 5, wherein the transportation mode for at least one leg is one of walking or biking and the safety index reflects safety of walking or biking through the location traversed for said leg.
This invention relates to transportation route planning, specifically for multimodal travel involving walking or biking. The problem addressed is the lack of safety considerations in existing route planning systems when recommending walking or biking segments. Many current systems prioritize speed or distance but do not adequately assess or incorporate safety factors such as pedestrian or cyclist hazards, traffic conditions, or infrastructure quality. The invention provides a method for generating a transportation route that includes at least one leg where the mode of transportation is walking or biking. For these legs, the system calculates a safety index that evaluates the safety of the proposed path for pedestrians or cyclists. This index considers factors such as traffic volume, road conditions, presence of sidewalks or bike lanes, crime rates, and other environmental hazards. The route planning algorithm then uses this safety index to select or modify the route, ensuring that recommended paths are not only efficient but also safe for walking or biking. The system may also provide alternative routes with varying safety levels, allowing users to choose based on their comfort and risk tolerance. This approach enhances user safety and confidence in multimodal transportation planning.
7. The method according to claim 6, wherein the safety index reflects a level of crime in the location traversed.
8. The method according to claim 1, wherein selecting the optional route comprises selecting a candidate route having the lowest total routing cost.
9. The method according to claim 1, wherein calculating the total routing cost of the candidate route comprises a summation of the respective travel costs of the edges and the node.
This invention relates to route optimization in transportation or logistics systems, addressing the challenge of efficiently determining the most cost-effective path between locations. The method calculates a total routing cost for a candidate route by summing individual travel costs associated with both the edges (segments) and nodes (intersections or waypoints) along the path. The travel costs for edges may include factors such as distance, time, fuel consumption, or toll fees, while node costs may account for delays, turn penalties, or other constraints at intersections. The method ensures accurate cost assessment by incorporating both segment and node contributions, enabling better decision-making for route selection. This approach is particularly useful in applications like vehicle navigation, fleet management, or delivery route planning, where minimizing overall travel expenses is critical. The summation process may involve weighted values or dynamic adjustments based on real-time conditions, ensuring adaptability to varying operational requirements. By considering both edge and node costs, the method provides a comprehensive cost analysis for optimizing routes in complex networks.
10. The method according to claim 1, further comprising calculating a total monetary cost of the edges and the node, wherein the optimal route is selected further based on the total monetary cost being below a predetermined threshold.
14. The method according to claim 11, wherein steps (a)-(f) are performed as ordered steps.
A method for performing a sequence of ordered steps in a technical process. The method addresses the problem of ensuring precise execution of interdependent operations in systems where step sequence is critical, such as manufacturing, data processing, or control systems. The method involves executing a series of steps in a predefined order, where each step depends on the completion of the prior step. The steps include initializing a process, validating input parameters, performing a primary operation, verifying the operation's outcome, generating a result, and finalizing the process. The ordered execution ensures that each step is completed before the next begins, preventing errors from missequencing. This method is particularly useful in applications where step dependencies are strict, such as in automated assembly lines, software pipelines, or real-time control systems. The method may include additional error-checking or feedback mechanisms to confirm step completion before proceeding. The ordered execution improves reliability and reduces the risk of system failures caused by out-of-sequence operations.
19. The system according to claim 15, wherein said navigation means comprises a processor and memory or storage device with instructions contained in the processor, memory or storage device configured to cause the processor to execute the configuration of claim 15.
20. The system according to claim 19, wherein said navigation means comprises a portable navigation device incorporating a display device as a part of a user interface.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
March 10, 2021
November 22, 2022
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.