Patent Application
20200209010
Providing navigation support to users is an important function for map service providers. Modern devices such as sophisticated navigation and communication systems can enable users or drivers of vehicles to have a better understanding of what is ahead or approaching on a road or route (e.g., points of interest (POIs), complicated interchanges, traffic status, road closures, etc.). In addition, providing parking support information (e.g., parking locations and/or parking availability) is another important function for map service providers. Parking support information is particularly useful in areas (e.g., a city center) where finding available parking may be time consuming and/or frustrating. However, presenting or visualizing a parking search route to users in a quickly readable manner can be challenging where such routes overlap, intersect, and/or loop, etc. until an available parking space is found within the vicinity of a destination.
As a result, there is a need for presenting to a user of a vehicle an efficient visual representation of a complex parking search route.
According to one embodiment, a computer-implemented method for presenting to a user in a vehicle a visual representation of a route for finding a parking space for the vehicle, wherein the route comprises road segments having potential parking spaces for the vehicle with a threshold of a destination, the method comprising upon determining that a visual representation of the route meets a criterion for complexity, providing a visual representation of an initial extent of the route to the user in a user interface, wherein the initial extent comprises a portion of the route ahead of a current position of the user and further wherein the visual representation of the initial extent does not meet the criterion for complexity. The method also comprises providing a route extension icon rendered at the initial extent in the user interface.
According to another embodiment, an apparatus for presenting to a user in a vehicle a visual representation of a route for finding a parking space for the vehicle, wherein the route comprises road segments having potential parking spaces for the vehicle within a threshold of a destination comprises at least one processor, and at least one memory including computer program code for one or more computer programs, the at least one memory and the computer program code configured to, with the at least one processor, cause, at least in part, the apparatus to upon determining that a visual representation of the route meets a criterion for complexity, provide a visual representation of an initial extent of the route to the user in a user interface, wherein the initial extent comprises a portion of the route ahead of a current position of the user and further wherein the visual representation of the initial extent does not meet the criterion for complexity. The apparatus is also caused to provide a route extension icon rendered at the initial extent in the user interface.
According to another embodiment, a non-transitory computer-readable storage medium for presenting to a user in a vehicle a visual representation of a route that circles in a vicinity of a location until a condition is met, wherein the route comprises road segments within a threshold of the location carries one or more sequences of one or more instructions which, when executed by one or more processors, cause, at least in part, an apparatus to upon determining that a visual representation of the route meets a criterion for complexity, provide a visual representation of an initial extent of the route to the user in a user interface, wherein the initial extent comprises a portion of the route ahead of a current position of the user and further wherein the visual representation of the initial extent does not meet the criterion for complexity. The apparatus is also caused to provide a route extension icon rendered at the initial extent in the user interface.
According to another embodiment, an apparatus for presenting to a user in a vehicle a visual representation of a route for finding a parking space for the vehicle, wherein the route comprises road segments having potential parking spaces for the vehicle within a threshold of a destination comprises means for upon determining that a visual representation of the route meets a criterion for complexity, providing a visual representation of an initial extent of the route to the user in a user interface, wherein the initial extent comprises a portion of the route ahead of a current position of the user and further wherein the visual representation of the initial extent does not meet the criterion for complexity. The apparatus also comprises means for providing a route extension icon rendered at the initial extent in the user interface.
In addition, for various example embodiments of the invention, the following is applicable: a method comprising facilitating a processing of and/or processing (1) data and/or (2) information and/or (3) at least one signal, the (1) data and/or (2) information and/or (3) at least one signal based, at least in part, on (or derived at least in part from) any one or any combination of methods (or processes) disclosed in this application as relevant to any embodiment of the invention.
For various example embodiments of the invention, the following is also applicable: a method comprising facilitating access to at least one interface configured to allow access to at least one service, the at least one service configured to perform any one or any combination of network or service provider methods (or processes) disclosed in this application.
For various example embodiments of the invention, the following is also applicable: a method comprising facilitating creating and/or facilitating modifying (1) at least one device user interface element and/or (2) at least one device user interface functionality, the (1) at least one device user interface element and/or (2) at least one device user interface functionality based, at least in part, on data and/or information resulting from one or any combination of methods or processes disclosed in this application as relevant to any embodiment of the invention, and/or at least one signal resulting from one or any combination of methods (or processes) disclosed in this application as relevant to any embodiment of the invention.
For various example embodiments of the invention, the following is also applicable: a method comprising creating and/or modifying (1) at least one device user interface element and/or (2) at least one device user interface functionality, the (1) at least one device user interface element and/or (2) at least one device user interface functionality based at least in part on data and/or information resulting from one or any combination of methods (or processes) disclosed in this application as relevant to any embodiment of the invention, and/or at least one signal resulting from one or any combination of methods (or processes) disclosed in this application as relevant to any embodiment of the invention.
In various example embodiments, the methods (or processes) can be accomplished on the service provider side or on the mobile device side or in any shared way between service provider and mobile device with actions being performed on both sides.
For various example embodiments, the following is applicable: An apparatus comprising means for performing the method of any of the claims.
Still other aspects, features, and advantages of the invention are readily apparent from the following detailed description, simply by illustrating a number of particular embodiments and implementations, including the best mode contemplated for carrying out the invention. The invention is also capable of other and different embodiments, and its several details can be modified in various respects, all without departing from the spirit and scope of the invention. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not as restrictive.
The embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings:
Examples of a method, apparatus, and computer program for presenting to a user of a vehicle an efficient visual representation of a complex route for finding a parking space for the vehicle are disclosed. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the invention. It is apparent, however, to one skilled in the art that the embodiments of the invention may be practiced without these specific details or with an equivalent arrangement. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the embodiments of the invention.
One example of a potentially complex parking search route is a route that continues, overlaps, intersects, and/or loops, etc. until an available parking space is found within the vicinity of a destination (i.e., the route may be considered infinite and/or endless). As mentioned above, parking guidance and/or parking related information is also an integral function for map service providers. For example, a user may want to know where she or he can find parking (e.g., on-street parking, car parks, parking garages, etc.) at or near a given destination and she or he may also want to know whether parking is or will be available at such locations and times. In many instances, a user wants to know this information in real time or substantially real time. Parking guidance and/or parking search routes may be particularly useful to users in areas where finding a parking space is often time consuming and/or frustrating due to a limited number of free spaces and/or many users simultaneously looking for parking (e.g., city centers). In addition, drivers need to pay attention to applicable driving restrictions (e.g., no left turns) while monitoring the possibly free spaces, which can also make finding parking in such areas challenging.
However, a parking search route or other complex navigation route may become very hard to read in a quick and efficient manner when being visualized or rendered in a user interface (UI) to a user in a vehicle. For example, a complex route can be calculated to have a user or a driver circle within a defined area (e.g., a geo-fenced area) around a specified destination. As a result, different portions of the presented route may overlap, intersect (e.g., self-intersect or cross over itself), even loop making it difficult for a user to know what is coming ahead and/or confused by this information. In addition, providing a user with all available information/options/alternatives can make the parking search route convoluted and difficult to quickly understand, especially in a user interface (e.g., a mobile device). In some instances, such displays may be distracting and/or may not comply with applicable regulations (e.g., National Highway Traffic Safety Administration (NHTSA) prohibiting users from looking at a display too long to understand what actions to take (i.e., keeping one's eyes away from the road).
Referring to
To address these technical problems, a system 100 of
In one embodiment, the system 100 of
In one embodiment, the system 100 first determines a destination (e.g., a restaurant, a movie theater, a shop, etc.) that does not have convenient available parking (e.g., an attached parking lot or parking structure). In one instance, the system 100 determines the destination based on a user manually setting or inputting the destination using one or more applications 111a-111n (also collectively referred to herein as applications 111) (e.g., a navigation application, a mapping application, a parking application, etc.) associated with the UEs 105.
In one embodiment, the system 100 then determines the parking spot availability in a zone around a destination or within a threshold of the destination and computes the best possible route to the parking spot. In one instance, the best possible route comprises an infinite/endless route. For example, the system 100 may continue to calculate and to render the parking search route until the user finds parking and has parked. Further, in one instance, if a user is unable to find parking at or around the given destination (e.g., within a threshold distance of the destination), the system 100 may suggest another comparable destination and continue or extend the route to that destination. In one embodiment, the system 100 determines the best possible route depending on parking availability, driving situation, and walking distance. In one instance, the system 100 may determine the parking spot availability based on information or data stored in or accessible via a geographic database (e.g., a geographic database 113), a digital map, or a combination thereof. In one embodiment, the system 100 may also determine the parking spot availability based on one or more parking related factors. For example, the one or more relevant parking related factors may include temporal factors (e.g., time of day, day of week); contextual factors (e.g., starting and/or ending times of an event); regulatory factors (e.g., no parking permitted), or a combination thereof. In one embodiment, the system 100 can define the zone based on a driving situation and/or a walking distance. For example, in one instance, the system 100 can compute the zone to include at least one or more roads or links that would permit the user or the driver to find available parking. In one embodiment, the threshold can be time-based, distance-based, or a combination thereof. By way of example, the system 100 can define the zone such that when a user finds parking, they are less than a certain distance and/or an amount of time away from the destination (e.g., within walking distance).
In one embodiment, the system 100 identifies when the readability of the parking search route would become low if visualized to a user all at one time and, therefore, leading to bad user experience. In one instance, the system 100 determines the readability of the route by computing the structural and aesthetical components of the route (i.e., “route limits”) such as intersections, overlaps, turns, walk time, etc. In one embodiment, the system 100 determines the so called “limit” of the route to be rendered or “route limits” based on one or more of the following rules: (1) road segments should not overlap; (2) route segments should ideally not intersect or cross; (3) route segments should ideally not make loops; (4) the system 100 should consider the aesthetics of the route if possible; and (5) some availability threshold may be considered by the system 100 for the route rendering as well. In other words, if a user is likely to quickly find a spot, the route displayed by the system 100 may be shorter than the same path which would have lower parking chances. By way of example, an overlapping segment is a segment that is rendered in opposite directions on the same road in connection with a destination such that two segments overlap each other. A looping segment, for example, is a segment that passes through the same node (e.g., an intersection) in connection with a destination without overlapping. In both instances, the route may be difficult for a user to read without being confused.
In one embodiment, the system 100 only displays or presents the segments of the parking search route up until the computed virtual limit of the route rendering (i.e., the route meets a criterion for complexity). In one instance, the system 100 renders only the segments that can be displayed without potential confusion to the user despite the system 100's ability to render the entire route to the destination. In one embodiment, the system 100 can “unlock” the route (i.e., render the route) when a driver of a vehicle 101 passes the intersection point with the “limit” of the parking search route. In one embodiment, the system 100 can render or visualize the route up to a certain probability of finding a parking space. For example, the system 100 can render shorter routes when a user or a driver of a vehicle 101 is passing through road segments with a high probability of having potential parking spaces for the vehicle 101 and the system 100 can render longer routes when a user or a driver of a vehicle 101 is passing through road segments with a low probability of having potential parking spaces for the vehicle 101. In one embodiment, the system 100 can determine the probability of available parking by collecting data or information from the geographic database 113 relative to the one or more road segments.
In one embodiment, the system 100 can enable a user to preview one or more “future” portions of the parking search route through one or more interactions (e.g., touch, voice, gesture, etc.). For example, the system 100 can render a route extension icon at the end of the currently visible route (i.e., the initial extent). In one embodiment, the system 100 can enable the user to extend the rendering of the route (e.g., beyond the computed “limit”) based on determining one or more interactions by the user. For example, a user can manually adjust the limit of the route (e.g., via an application 111) to see how it further expands (e.g., to let a friend following behind know where additional parking may be available). In one instance, the route could also expand when a vehicle 101 speed is null (e.g., the vehicle 101 is stopped at a traffic light or a stop sign) so that the user can preview a few more maneuvers. In one embodiment, the system 100 can also enable a user to extend the route through a voice command (e.g., “show me more”). In one embodiment, the system 100 returns the rendering back to the previous state after the user releases/finishes her or his manual interaction, so that the user-friendly guidance of the system 100 can continue as described above.
Referring to
As shown in
In one embodiment, the system 100 can render the route 303 up to a certain probability value of finding a parking space. For example, the route 303 rendered by the system 100 may be shorter where the user of the vehicle 101 is passing through portions of segment 303b that have a relatively high probability of finding parking for the vehicle 101 and longer where the user or the vehicle 101 is passing though portions of segment 303b that have a relatively low probability of finding parking for the vehicle 101, as depicted in
In one embodiment, the route comprises road segments having potential parking spaces for the vehicle within a threshold of a destination (e.g., within a walking distance). In another embodiment, the route circles in the vicinity of a location until a condition is met, wherein the route comprises road segments within a threshold of the location. By way of example, the route may circle in the vicinity of a friend's or colleague's home and the condition may be met when the friend or colleague is ready to be picked up by a user of a vehicle 101 (e.g., a driver or an operator) and/or a vehicle 101 (e.g., an autonomous vehicle) to go work, a POI (e.g., a restaurant), etc. In another example, the route may circle in the vicinity of a school and the condition may be met when the students attending the school are picked up by a user of vehicle 101 and/or a vehicle 101 and brought to school. In a further example, the route may circle in the vicinity of an airport, a sporting or entertainment venue, etc. and the condition may be met when the travelers or the attendees are picked up by a user of a vehicle 101 and/or a vehicle 101 from one or more satellite locations and brought to the airport or the venue, respectively. In one embodiment, the route can be any navigation or complex route that is to be presented to an end user in a vehicle (e.g., a vehicle 101). As discussed above, the route can include but is not limited to a parking search route or other complex navigation route (e.g., a route that includes self-intersections, loops, etc. that can be visually confusing to render). This route can be computed by the mapping module 401 or otherwise provided to the mapping module 401. For example, the route may have no specified destination and/or may be traveled until a condition is achieved (e.g., all students are picked up before the start of school).
In one embodiment, the condition is finding a parking space (e.g., for a vehicle 101) proximate to or in the vicinity of at a destination specified by a user (e.g., within a distance-based threshold, a time-based threshold, or a combination thereof). By way of example, the destination may be any POI such as a home, an office, a restaurant, a hospital, a shop, a park, a playground, a museum, a sport or an entertainment venue, etc. that a user or driver of a vehicle (e.g., a vehicle 101) wants to park at or near, but that does not have convenient available parking (e.g., an attached parking lot or parking structure). Typically, such destinations are in densely populated areas (e.g., a city center) and do not have convenient available parking due to the high costs associated with such properties. In one embodiment, a user can specify the destination through an interaction or input (e.g., a touch, a voice command, a gesture, etc.) with an application 111 (e.g., a navigation application) associated with a UE 105, a vehicle 101, or a combination thereof. By way of example, the computed route may be considered a complex route because the route can be traveled infinitely, endlessly, indeterminately, etc. until the condition is met (i.e., the user parks). In this way, the mapping module 403 may continue to render or visualize the route (e.g., via an embedded navigation system) until the user parks or ends the route. For example, the route may “circle” around itself or along one or more streets around the destination before an available parking space is found. The problem with such complex parking search routes; however, is that they can become very hard to quickly and efficiently read when being visualized to a user in a vehicle, especially if a user is having difficulty finding parking. For example, the rendered road segments may start to overlap, intersect, or make loops, with previously traveled portions, portions not yet traveled, or a combination thereof, all which can prevent a user from knowing what is coming ahead without being confused by the information. Other navigation routes that can be used according to the process 500 can include any route wherein a user is in a vehicle 101 and the user and/or the vehicle 101 (e.g., an autonomous vehicle) is searching for someone (e.g., one or more additional passengers), something (e.g., one or more pick-up/drop-off locations, one or more gas or charging stations, etc.), or a combination thereof and the visualized route may continue, overlap, intersect, and/or loop, etc. until the someone and/or something is located (i.e., a condition is met).
In step 501, upon the data processing module 403 determining in conjunction with the mapping module 401 that a visual representation of the route (e.g., a parking search route) meets a criterion of complexity (i.e., cannot be displayed without confusing the user), the rendering module 405 in connection with the UI module 407 provides a visual representation of an initial extent of the route to a user in a vehicle (e.g., a vehicle 101) in a user interface (e.g., a UE 105). In one embodiment, the initial extent comprises a portion of the route ahead of a current position of the user and the visual representation of the initial extent does not meet the criterion for complexity (i.e., can be displayed without confusion of the user). By way of example, the initial extent may be the minimal amount of the route ahead of the current position of the user that the calculation module 409 determines is useful and/or visually appealing to the user. For example, a visualization or rendering of a parking search route at the end of the destination guidance route when there are still hours of traveling before the destination is likely to make the route hard to read and/or confuse the user. This is especially true at higher zoom levels (e.g., in a route overview mode). Likewise, a visualization or rendering of previously traveled portions when a user is searching for parking is likely to make the route hard to read and/or confuse the user.
In one embodiment, the rendering module 405 renders another extent of the route beyond the initial extent rendered in the user interface based on the mapping module 401 determining that a location of the user of the route is at or within a proximity threshold of the initial extent (e.g., the user is about to complete traveling the initial extent of the route). In this regard, the rendering module 405 can provide the visual representation to the user dynamically. Specifically, in one embodiment, the calculation module 409 is constantly updating the criterion for complexity (i.e., the amount that can or cannot be displayed without confusion of the user) and the rendering module 405 is constantly updating the presentation or rendering within the computed limits as the user travels the route.
In one embodiment, the calculation module 409 determines the visual representation of the initial extent of the route based on a criterion for complexity or a route limit. In one instance, the criterion or route limit is a structural and/or aesthetical component of the route (e.g., intersections, overlaps, turns, walk times, etc.). In one embodiment, the criterion for complexity includes avoiding at least one of: (1) an overlap of two or more road segments; (2) an intersection of two or more road segments; and (3) a making of a loop with two or more road segments. In one instance, the road segments have potential parking spaces for the vehicle 101 within a threshold of the destination (e.g., a walkable or walking distance). By way of example, an intersection of two or more road segments comprises self-intersecting segments or a perpendicular crossing of the segments. By way of another example, a loop passes through the same node (e.g., an intersection) without overlapping. In one instance, the calculation module 409 also determines the criterion of complexity based on a route aesthetic criterion, a route readability criterion, or a combination thereof. By way of example, an aesthetically pleasing and/or readable route may be a simple route that includes the minimal amount of information needed to find a parking spot. Further, the calculation module 409 determines the criterion for complexity, in one instance, based on a speed of a vehicle 101 traveling the route. By way of example, because the calculation module 409 is constantly updating the route as the user drives or travels it, the criterion of complexity corresponds to the speed of the vehicle 101 (i.e., the faster or slower that the vehicle 101 moves, the faster or slower that the calculation module 409 needs to determine the criterion).
In one embodiment, the calculation module 409 can decrease the initial extent provided to the user based on determining an increase in the potential parking spaces on the road segments of the route and the calculation module 409 can increase the initial extent provided to the user based on determining a decrease in the in the potential parking spaces on the road segments of the route. By way of example, the data processing module 403 may provide parking space data stored in or accessible via the geographic database 113, a digital map, or a combination thereof. In one embodiment, the data process module 401 may provide parking space data based on one or more parking related factors. For example, the one or more relevant parking related factors may include temporal factors (e.g., time of day, day of week); contextual factors (e.g., starting and/or ending times of an event); regulatory factors (e.g., no parking permitted), or a combination thereof.
In one embodiment, the data processing module 403 provides parking space data relative to a zone around the destination. For example, the mapping module 401 and/or the calculation module 409 can define the zone based on a driving situation and/or a walking distance. In one embodiment, the mapping module 401 can compute the zone to include at least one or more roads or links that would permit the user or the driver of a vehicle 101 to find available parking. In one instance, the calculation module 409 can define the zone such that when a user finds parking, they are less than a distance-based threshold, a time-based threshold, or a combination thereof from the destination (e.g., within walking distance). In one embodiment, the data processing module 403 can then provide the parking space data to the rendering module 405 for rendering of the initial extent of the route to the user in a user interface (e.g., a UE 105). By way of example, if a user is likely to quickly find a spot, the initial extent presented may be shorter than a route which would have lower parking chances. In one instance, the calculation module 409 determines a stricter criterion of complexity, hence a shorter route, where the user is passing through road segments that are likely to have available parking and the calculation module 409 determines a more generous criterion, hence a longer route, where the user is passing through road segments that are unlikely to have available parking.
In step 503, the rendering module 405 in connection with the UI module 407 provides a route extension icon rendered at the initial extent in the user interface (e.g., a UE 105). In one embodiment, the rendering module 405 renders or presents another extent of the route beyond the initial extent rendered in the user interface (e.g., an embedded navigation system, a mobile device, or a combination thereof) based on the UI module 407 detecting a user interaction with the route extension icon in the user interface (e.g., a UE 105). Specifically, in one instance, the visual representation includes a route extension icon rendered at the initial extent of the route in the user interface. An example of a route extension icon is depicted in
In one embodiment, the system 100 determines the part or portions of the route that can be displayed without confusing the user (i.e., the initial extent that does not meet the criterion for complexity and/or would confuse the user). Specifically, the system 100 dynamically computes the limit of the route to be presented and then updates the route as the user drives or travels along the route. In this instance, the system 100 can determine to present only the portion of the route 611 (e.g., segment 611a) that is within an aesthetic and/or readability limit given the determined location of the user or the driver of the vehicle 101 (e.g., at home or a start of the journey). For example, the system 100 can determine that at this distance and/or time from the location 607, providing parking search information to the user would likely decrease the readability of the route 611 and, therefore, lead to a potentially bad user experience.
Alternatively, in one embodiment, the system 100 can show the user a next step (e.g., segment 611b), as depicted in
Referring to
Returning to
In one embodiment, the routing platform 107 performs the process for presenting to a user of a vehicle 101 an efficient visual representation of a complex route for finding a parking space for the vehicle 101 as discussed with respect to the various embodiments described herein.
In one embodiment, the routing platform 107 can be a standalone server or a component of another device with connectivity to the communication network 109. For example, the component can be part of an edge computing network where remote computing devices (not shown) are installed along or within proximity of an intended destination (e.g., a city center). In one embodiment, the routing platform 107 has connectivity over the communication network 109 to the services platform 117 (e.g., an OEM platform) that provides one or more services 119a-119n (also collectively referred to herein as services 119) (e.g., traffic/routing services). By way of example, the services 119 may also be other third-party services and include mapping services, navigation services, parking services, travel planning services, notification services, social networking services, content (e.g., audio, video, images, etc.) provisioning services, application services, storage services, contextual information determination services, location-based services, information-based services (e.g., weather, news, etc.), etc.
In one embodiment, content providers 121a-121n (also collectively referred to herein as content providers 121) may provide content or data (e.g., navigation-based content such as destination information, routing instructions, POI data, historical data, etc.) to the vehicles 101, the routing platform 107, the UEs 105, the applications 111, the geographic database 113, the services platform 117, and the services 119. The content provided may be any type of content, such as map content, contextual content, audio content, video content, image content, etc. In one embodiment, the content providers 121 may also store content associated with the vehicles 101, the UEs 105, the routing platform 107, the applications 111, the geographic database 113, the services platform 117, and/or the services 119. In another embodiment, the content providers 121 may manage access to a central repository of data, and offer a consistent, standard interface to data, such as a repository of the geographic database 113.
By way of example, as previously stated the vehicle sensors 103 may be any type of sensor. In certain embodiments, the vehicle sensors 103 may include, for example, a global positioning system (GPS) sensor for gathering location data, a network detection sensor for detecting wireless signals or receivers for different short-range communications (e.g., Bluetooth, Wi-Fi, light fidelity (Li-Fi), near field communication (NFC) etc.), temporal information sensors, a camera/imaging sensor for gathering image data (e.g., lights or exhaust associated with a vehicle 101 about to leave a parking spot), velocity sensors, and the like. In another embodiment, the vehicle sensors 103 may include sensors (e.g., mounted along a perimeter of the vehicle 101) to detect the relative distance of the vehicle from lanes or roadways, the presence of other vehicles 101, pedestrians, animals, traffic lights, road features (e.g., curves) and any other objects, or a combination thereof. In one scenario, the vehicle sensors 103 may detect weather data, traffic information, or a combination thereof. In one example embodiment, the vehicles 101 may include GPS receivers to obtain geographic coordinates from satellites 115 for determining current or live location and time. Further, the location can be determined by a triangulation system such as A-GPS, Cell of Origin, or other location extrapolation technologies when cellular or network signals are available. In another example embodiment, the services 119 may provide in-vehicle navigation services.
The communication network 109 of system 100 includes one or more networks such as a data network, a wireless network, a telephony network, or any combination thereof. It is contemplated that the data network may be any local area network (LAN), metropolitan area network (MAN), wide area network (WAN), a public data network (e.g., the Internet), short range wireless network, or any other suitable packet-switched network, such as a commercially owned, proprietary packet-switched network, e.g., a proprietary cable or fiber-optic network, and the like, or any combination thereof. In addition, the wireless network may be, for example, a cellular network and may employ various technologies including enhanced data rates for global evolution (EDGE), general packet radio service (GPRS), global system for mobile communications (GSM), Internet protocol multimedia subsystem (IMS), universal mobile telecommunications system (UMTS), etc., as well as any other suitable wireless medium, e.g., worldwide interoperability for microwave access (WiMAX), Long Term Evolution (LTE) networks, code division multiple access (CDMA), wideband code division multiple access (WCDMA), wireless fidelity (Wi-Fi), wireless LAN (WLAN), Bluetooth®, Internet Protocol (IP) data casting, satellite, mobile ad-hoc network (MANET), and the like, or any combination thereof.
In one embodiment, the routing platform 107 may be a platform with multiple interconnected components. By way of example, the routing platform 107 may include multiple servers, intelligent networking devices, computing devices, components and corresponding software for presenting to a user of a vehicle 101 an efficient visual representation of a complex route for finding a parking space for the vehicle 101. In addition, it is noted that the routing platform 107 may be a separate entity of the system 100, a part of the services platform 117, the one or more services 119, or the content providers 121.
In one embodiment, the geographic database 113 stores information regarding parking spot availability in a zone around or a threshold from a destination (e.g., available parking location, historic parking probability data, parking restriction data, etc.). In one instance, the geographic database 113 also stores driving situation data (e.g., historic or current traffic levels) and walking distance (e.g., average walk times). The information may be any of multiple types of information that can provide means for providing navigation-based content (e.g., a parking search route). In another embodiment, the geographic database 113 may be in a cloud and/or in a vehicle 101, a UE 105, or a combination thereof.
By way of example, the vehicles 101, the UEs 105, the routing platform 107, the applications 111, the geographic database 113, the satellites 115, the services platform 117, the services 119, and the content providers 121 communicate with each other and other components of the communication network 109 using well known, new or still developing protocols. In this context, a protocol includes a set of rules defining how the network nodes within the communication network 109 interact with each other based on information sent over the communication links. The protocols are effective at different layers of operation within each node, from generating and receiving physical signals of various types, to selecting a link for transferring those signals, to the format of information indicated by those signals, to identifying which software application executing on a computer system sends or receives the information. The conceptually different layers of protocols for exchanging information over a network are described in the Open Systems Interconnection (OSI) Reference Model.
Communications between the network nodes are typically effected by exchanging discrete packets of data. Each packet typically comprises (1) header information associated with a particular protocol, and (2) payload information that follows the header information and contains information that may be processed independently of that particular protocol. In some protocols, the packet includes (3) trailer information following the payload and indicating the end of the payload information. The header includes information such as the source of the packet, its destination, the length of the payload, and other properties used by the protocol. Often, the data in the payload for the particular protocol includes a header and payload for a different protocol associated with a different, higher layer of the OSI Reference Model. The header for a particular protocol typically indicates a type for the next protocol contained in its payload. The higher layer protocol is said to be encapsulated in the lower layer protocol. The headers included in a packet traversing multiple heterogeneous networks, such as the Internet, typically include a physical (layer 1) header, a data-link (layer 2) header, an internetwork (layer 3) header and a transport (layer 4) header, and various application (layer 5, layer 6 and layer 7) headers as defined by the OSI Reference Model.
In exemplary embodiments, the road segment data records 705 are links or segments representing roads, streets, or paths, as can be used in calculating a likelihood of overlap, intersection, or looping between two or more route segments. The node data records 703 are end points corresponding to the respective links or segments of the road segment data records 705. The road link data records 705 and the node data records 703 represent a road network, such as used by vehicles, cars, and/or other entities. Alternatively, the geographic database 113 can contain path segment and node data records or other data that represent pedestrian paths or areas in addition to or instead of the vehicle road record data, for example.
The road link and nodes can be associated with attributes, such as geographic coordinates, street names, address ranges, speed limits, turn restrictions at intersections, and other navigation related attributes, as well as POIs, such as traffic controls (e.g., stoplights, stop signs, crossings, etc.), gas or petrol stations, hotels, restaurants, museums, stadiums, offices, shopping centers or malls, parking lots, automobile dealerships, auto repair shops, buildings, stores, parks, etc. The geographic database 113 can include data about the POIs and their respective locations in the POI data records 707 (e.g., proximity of convenient available parking such as an attached parking lot or parking structure). The geographic database 113 can also include data about places, such as cities, city centers, towns, or other communities, and other geographic features, such as bodies of water, mountain ranges, etc. Such place or feature data can be part of the POI data records 707 or can be associated with POIs or POI data records 707 (such as a data point used for displaying or representing a position of a city).
In one embodiment, the parking availability data 709 can include any data item used to detect or identify parking spaces, available parking spaces, or a combination thereof. In one instance, the parking availability data 709 can also include any data related to a vehicle in a parking space (e.g., time of parking, time remaining on a meter, etc.). In one embodiment, the parking availability data 709 in connection with the road segment data records 705 or separately can include any data item use to detect or identify a probability value to find a parking space on a road or segment (e.g., a historic value, a current value, or a combination thereof).
The geographic database 113 can be maintained by the content providers 121 in association with the services platform 117 (e.g., a map developer). The map developer can collect geographic data to generate and enhance the geographic database 113. There can be different ways used by the map developer to collect data. These ways can include obtaining data from other sources, such as municipalities or respective geographic authorities. In addition, the map developer can employ field personnel to travel by vehicle along roads throughout the geographic region to observe features and/or record information about them, for example. Also, remote sensing, such as aerial or satellite photography, can be used.
The geographic database 113 can be a master geographic database stored in a format that facilitates updating, maintenance, and development. For example, the master geographic database 113 or data in the master geographic database 113 can be in an Oracle spatial format or other spatial format, such as for development or production purposes. The Oracle spatial format or development/production database can be compiled into a delivery format, such as a geographic data files (GDF) format. The data in the production and/or delivery formats can be compiled or further compiled to form geographic database products or databases, which can be used in end user navigation devices or systems.
For example, geographic data or geospatial information is compiled (such as into a platform specification format (PSF) format) to organize and/or configure the data for performing map or navigation-related functions and/or services, such as map annotation, route calculation, route guidance, map display, speed calculation, distance and travel time functions, and other functions, by a navigation device, such as by a UE 105, for example. The navigation-related functions can correspond to vehicle navigation, pedestrian navigation, or other types of navigation. The compilation to produce the end user databases can be performed by a party or entity separate from the map developer. For example, a customer of the map developer, such as a navigation device developer or other end user device developer, can perform compilation on a received geographic database in a delivery format to produce one or more compiled navigation databases.
As mentioned above, the geographic database 113 can be a master geographic database, but in alternate embodiments, the geographic database 113 can represent a compiled navigation database that can be used in or with end user devices (e.g., a UE 105) to provide navigation-related functions. For example, the geographic database 113 can be used with the end user device to provide an end user with navigation features (e.g., a parking search route). In such a case, the geographic database 113 can be downloaded or stored on the end user device, such as in an application 111, or the end user device can access the geographic database 113 through a wireless or wired connection (such as via a server and/or the communication network 109), for example.
The processes described herein for presenting to a user of a vehicle an efficient visual representation of a complex route for finding a parking space for the vehicle may be advantageously implemented via software, hardware (e.g., general processor, Digital Signal Processing (DSP) chip, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Arrays (FPGAs), etc.), firmware or a combination thereof. Such exemplary hardware for performing the described functions is detailed below.
A bus 810 includes one or more parallel conductors of information so that information is transferred quickly among devices coupled to the bus 810. One or more processors 802 for processing information are coupled with the bus 810.
A processor 802 performs a set of operations on information as specified by computer program code related to presenting to a user of a vehicle an efficient visual representation of a complex route for finding a parking space for the vehicle. The computer program code is a set of instructions or statements providing instructions for the operation of the processor and/or the computer system to perform specified functions. The code, for example, may be written in a computer programming language that is compiled into a native instruction set of the processor. The code may also be written directly using the native instruction set (e.g., machine language). The set of operations include bringing information in from the bus 810 and placing information on the bus 810. The set of operations also typically include comparing two or more units of information, shifting positions of units of information, and combining two or more units of information, such as by addition or multiplication or logical operations like OR, exclusive OR (XOR), and AND. Each operation of the set of operations that can be performed by the processor is represented to the processor by information called instructions, such as an operation code of one or more digits. A sequence of operations to be executed by the processor 802, such as a sequence of operation codes, constitute processor instructions, also called computer system instructions or, simply, computer instructions. Processors may be implemented as mechanical, electrical, magnetic, optical, chemical or quantum components, among others, alone or in combination.
Computer system 800 also includes a memory 804 coupled to bus 810. The memory 804, such as a random-access memory (RAM) or other dynamic storage device, stores information including processor instructions for presenting to a user of a vehicle an efficient visual representation of a complex route for finding a parking space for the vehicle. Dynamic memory allows information stored therein to be changed by the computer system 800. RAM allows a unit of information stored at a location called a memory address to be stored and retrieved independently of information at neighboring addresses. The memory 804 is also used by the processor 802 to store temporary values during execution of processor instructions. The computer system 800 also includes a read only memory (ROM) 806 or other static storage device coupled to the bus 810 for storing static information, including instructions, that is not changed by the computer system 800. Some memory is composed of volatile storage that loses the information stored thereon when power is lost. Also coupled to bus 810 is a non-volatile (persistent) storage device 808, such as a magnetic disk, optical disk or flash card, for storing information, including instructions, that persists even when the computer system 800 is turned off or otherwise loses power.
Information, including instructions for presenting to a user of a vehicle an efficient visual representation of a complex route for finding a parking space for the vehicle, is provided to the bus 810 for use by the processor from an external input device 812, such as a keyboard containing alphanumeric keys operated by a human user, or a sensor. A sensor detects conditions in its vicinity and transforms those detections into physical expression compatible with the measurable phenomenon used to represent information in computer system 800. Other external devices coupled to bus 810, used primarily for interacting with humans, include a display device 814, such as a cathode ray tube (CRT) or a liquid crystal display (LCD), or plasma screen or printer for presenting text or images, and a pointing device 816, such as a mouse or a trackball or cursor direction keys, or motion sensor, for controlling a position of a small cursor image presented on the display 814 and issuing commands associated with graphical elements presented on the display 814. In some embodiments, for example, in embodiments in which the computer system 800 performs all functions automatically without human input, one or more of external input device 812, display device 814 and pointing device 816 is omitted.
In the illustrated embodiment, special purpose hardware, such as an application specific integrated circuit (ASIC) 820, is coupled to bus 810. The special purpose hardware is configured to perform operations not performed by processor 802 quickly enough for special purposes. Examples of application specific ICs include graphics accelerator cards for generating images for display 814, cryptographic boards for encrypting and decrypting messages sent over a network, speech recognition, and interfaces to special external devices, such as robotic arms and medical scanning equipment that repeatedly perform some complex sequence of operations that are more efficiently implemented in hardware.
Computer system 800 also includes one or more instances of a communications interface 870 coupled to bus 810. Communication interface 870 provides a one-way or two-way communication coupling to a variety of external devices that operate with their own processors, such as printers, scanners and external disks. In general, the coupling is with a network link 878 that is connected to a local network 880 to which a variety of external devices with their own processors are connected. For example, communication interface 870 may be a parallel port or a serial port or a universal serial bus (USB) port on a personal computer. In some embodiments, communications interface 870 is an integrated services digital network (ISDN) card or a digital subscriber line (DSL) card or a telephone modem that provides an information communication connection to a corresponding type of telephone line. In some embodiments, a communication interface 870 is a cable modem that converts signals on bus 810 into signals for a communication connection over a coaxial cable or into optical signals for a communication connection over a fiber optic cable. As another example, communications interface 870 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN, such as Ethernet. Wireless links may also be implemented. For wireless links, the communications interface 870 sends or receives or both sends and receives electrical, acoustic or electromagnetic signals, including infrared and optical signals, that carry information streams, such as digital data. For example, in wireless handheld devices, such as mobile telephones like cell phones, the communications interface 870 includes a radio band electromagnetic transmitter and receiver called a radio transceiver. In certain embodiments, the communications interface 870 enables connection to the communication network 109 for presenting to a user of a vehicle an efficient visual representation of a complex route for finding a parking space for the vehicle.
The term non-transitory computer-readable medium is used herein to refer to any medium that participates in providing information to processor 802, including instructions for execution. Such a medium may take many forms, including, but not limited to, non-volatile media, volatile media and transmission media. Non-volatile or non-transitory media include, for example, optical or magnetic disks, such as storage device 808. Volatile media include, for example, dynamic memory 804. Transmission media include, for example, coaxial cables, copper wire, fiber optic cables, and carrier waves that travel through space without wires or cables, such as acoustic waves and electromagnetic waves, including radio, optical and infrared waves. Signals include man-made transient variations in amplitude, frequency, phase, polarization or other physical properties transmitted through the transmission media. Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, any other magnetic medium, a CD-ROM, CDRW, DVD, any other optical medium, punch cards, paper tape, optical mark sheets, any other physical medium with patterns of holes or other optically recognizable indicia, a RAM, a PROM, an EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave, or any other medium from which a computer can read.
In one embodiment, a non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions (e.g., computer code) which, when executed by one or more processors (e.g., a processor as described in
In one embodiment, the chip set 900 includes a communication mechanism such as a bus 901 for passing information among the components of the chip set 900. A processor 903 has connectivity to the bus 901 to execute instructions and process information stored in, for example, a memory 905. The processor 903 may include one or more processing cores with each core configured to perform independently. A multi-core processor enables multiprocessing within a single physical package. Examples of a multi-core processor include two, four, eight, or greater numbers of processing cores. Alternatively or in addition, the processor 903 may include one or more microprocessors configured in tandem via the bus 901 to enable independent execution of instructions, pipelining, and multithreading. The processor 903 may also be accompanied with one or more specialized components to perform certain processing functions and tasks such as one or more digital signal processors (DSP) 907, or one or more application-specific integrated circuits (ASIC) 909. A DSP 907 typically is configured to process real-world signals (e.g., sound) in real time independently of the processor 903. Similarly, an ASIC 909 can be configured to performed specialized functions not easily performed by a general purposed processor. Other specialized components to aid in performing the inventive functions described herein include one or more field programmable gate arrays (FPGA) (not shown), one or more controllers (not shown), or one or more other special-purpose computer chips.
The processor 903 and accompanying components have connectivity to the memory 905 via the bus 901. The memory 905 includes both dynamic memory (e.g., RAM, magnetic disk, writable optical disk, etc.) and static memory (e.g., ROM, CD-ROM, etc.) for storing executable instructions that when executed perform the inventive steps described herein to present to a user of a vehicle an efficient visual representation of a complex route for finding a parking space for the vehicle. The memory 905 also stores the data associated with or generated by the execution of the inventive steps.
A radio section 1015 amplifies power and converts frequency in order to communicate with a base station, which is included in a mobile communication system, via antenna 1017. The power amplifier (PA) 1019 and the transmitter/modulation circuitry are operationally responsive to the MCU 1003, with an output from the PA 1019 coupled to the duplexer 1021 or circulator or antenna switch, as known in the art. The PA 1019 also couples to a battery interface and power control unit 1020.
In use, a user of mobile station 1001 speaks into the microphone 1011 and his or her voice along with any detected background noise is converted into an analog voltage. The analog voltage is then converted into a digital signal through the Analog to Digital Converter (ADC) 1023. The control unit 1003 routes the digital signal into the DSP 1005 for processing therein, such as speech encoding, channel encoding, encrypting, and interleaving. In one embodiment, the processed voice signals are encoded, by units not separately shown, using a cellular transmission protocol such as global evolution (EDGE), general packet radio service (GPRS), global system for mobile communications (GSM), Internet protocol multimedia subsystem (IMS), universal mobile telecommunications system (UMTS), etc., as well as any other suitable wireless medium, e.g., microwave access (WiMAX), Long Term Evolution (LTE) networks, code division multiple access (CDMA), WiFi, satellite, and the like.
The encoded signals are then routed to an equalizer 1025 for compensation of any frequency-dependent impairments that occur during transmission though the air such as phase and amplitude distortion. After equalizing the bit stream, the modulator 1027 combines the signal with a RF signal generated in the RF interface 1029. The modulator 1027 generates a sine wave by way of frequency or phase modulation. In order to prepare the signal for transmission, an up-converter 1031 combines the sine wave output from the modulator 1027 with another sine wave generated by a synthesizer 1033 to achieve the desired frequency of transmission. The signal is then sent through a PA 1019 to increase the signal to an appropriate power level. In practical systems, the PA 1019 acts as a variable gain amplifier whose gain is controlled by the DSP 1005 from information received from a network base station. The signal is then filtered within the duplexer 1021 and optionally sent to an antenna coupler 1035 to match impedances to provide maximum power transfer. Finally, the signal is transmitted via antenna 1017 to a local base station. An automatic gain control (AGC) can be supplied to control the gain of the final stages of the receiver. The signals may be forwarded from there to a remote telephone which may be another cellular telephone, other mobile phone or a land-line connected to a Public Switched Telephone Network (PSTN), or other telephony networks.
Voice signals transmitted to the mobile station 1001 are received via antenna 1017 and immediately amplified by a low noise amplifier (LNA) 1037. A down-converter 1039 lowers the carrier frequency while the demodulator 1041 strips away the RF leaving only a digital bit stream. The signal then goes through the equalizer 1025 and is processed by the DSP 1005. A Digital to Analog Converter (DAC) 1043 converts the signal and the resulting output is transmitted to the user through the speaker 1045, all under control of a Main Control Unit (MCU) 1003—which can be implemented as a Central Processing Unit (CPU) (not shown).
The MCU 1003 receives various signals including input signals from the keyboard 1047. The keyboard 1047 and/or the MCU 1003 in combination with other user input components (e.g., the microphone 1011) comprise a user interface circuitry for managing user input. The MCU 1003 runs a user interface software to facilitate user control of at least some functions of the mobile station 1001 to present to a user of a vehicle an efficient visual representation of a complex route for finding a parking space for the vehicle. The MCU 1003 also delivers a display command and a switch command to the display 1007 and to the speech output switching controller, respectively. Further, the MCU 1003 exchanges information with the DSP 1005 and can access an optionally incorporated SIM card 1049 and a memory 1051. In addition, the MCU 1003 executes various control functions required of the station. The DSP 1005 may, depending upon the implementation, perform any of a variety of conventional digital processing functions on the voice signals. Additionally, DSP 1005 determines the background noise level of the local environment from the signals detected by microphone 1011 and sets the gain of microphone 1011 to a level selected to compensate for the natural tendency of the user of the mobile station 1001.
The CODEC 1013 includes the ADC 1023 and DAC 1043. The memory 1051 stores various data including call incoming tone data and is capable of storing other data including music data received via, e.g., the global Internet. The software module could reside in RAM memory, flash memory, registers, or any other form of writable non-transitory computer readable storage medium known in the art. The memory device 1051 may be, but not limited to, a single memory, CD, DVD, ROM, RAM, EEPROM, optical storage, or any other non-volatile storage medium capable of storing digital data.
An optionally incorporated SIM card 1049 carries, for instance, important information, such as the cellular phone number, the carrier supplying service, subscription details, and security information. The SIM card 1049 serves primarily to identify the mobile station 1001 on a radio network. The card 1049 also contains a memory for storing a personal telephone number registry, text messages, and user specific mobile station settings.
While the invention has been described in connection with a number of embodiments and implementations, the invention is not so limited but covers various obvious modifications and equivalent arrangements, which fall within the purview of the appended claims. Although features of the invention are expressed in certain combinations among the claims, it is contemplated that these features can be arranged in any combination and order.
