TW201104224A - Improvements relating to navigation route planning - Google Patents

Abstract

A technique is disclosed for calculating a sightseeing route from a start location to a destination location. The start location and the destination location may be the same as each other or different. The route is calculated to pass one or more attractors each representing a sightseeing attraction. A digital database resource (500) contains digital map information, the digital map information including a plurality of attractors. The technique comprises (a) determining (550) an initial route from the start location to the destination location, and setting the initial route as a current route; (b) determining (602) for each attractor in a candidate set of the attractors, a relative attraction value that is dependent on a distance between the attractor and the current route; (c) determining (604, 612) which attractor corresponds to a largest attraction value; (d) modifying (620) the current route to include a deviation to the attractor determined at step (c).

Description

201104224 VI. Description of the Invention: TECHNICAL FIELD OF THE INVENTION The present invention is in the field of navigation path planning devices and methods associated therewith. These n pieces can be, for example, installed as a unitary vehicle device, or can be portable devices that can be used in a vehicle or in other poles. Alternatively, the device can be implemented on a fish ' /, on a 1 computer or a client-word server system. The invention may be implemented at least in part in a navigation device and/or at least in part by other financial means (the communication device H communicates with the other device). [Prior Art] A portable navigation device (PND) system including GPS (Global Positioning System) signal receiving and processing functions, is well known, and is widely used as an in-vehicle or other transportation tool navigation system. In general, modern PNDs include a processor, memory (at least one of volatility and non-volatile, and usually both) and map data stored in the memory. The processor cooperates with the memory to provide an execution environment in which a software operating system can be built and, in addition, one or more additional software programs are often provided to: enable the functionality of the pND to be controlled, and provide various other Features. Typically, such devices further include information that allows the user to interact with the device and to create one or more input interfaces for the lambda device, and one or more output interfaces, which can be accessed by S-one or more wheel-out interfaces. The relay is passed to the user. Illustrative examples of output interfaces include visual displays and speaker 15 for audio wheeling. Illustrative examples of the input interface include one or more physical buttons that control the on/off of the device or other features (if within the device, the buttons are not necessarily on the device itself, and A microphone for predicting the user's utterance. In a particularly preferred configuration, the touch-sensitive I:= interface display is configured as a touch-sensitive display (by touch-sensitive overlay or other) to provide an additional input. Interface, by which the user can operate the device by touching 4" "This type of device will also often include: one or more physical connector interfaces, wrong by the - or multiple physical connectors The interface 'transmits power signals and conditional data signals to the material and receives power signals and conditional data signals from the device; and, as the case may be, or multiple wireless transmitters/receivers, which allow for cellular telecommunications and Communication over other signal and data networks (eg, wi F/, Wi-MaxGSM, and the like). This type of PND device also includes a GPS antenna that can receive satellites including location data. Signals, and then processing the signals to determine the current position of the device. The PND state can also include electronic gyroscopes and accelerometers that generate signals that can be processed to determine current angular and linear acceleration, and combined The position information derived from the GPS signal determines the speed and relative displacement of the device and thus the vehicle of the device. Usually, these features are most commonly provided in the navigation system of the vehicle, but can also be provided In PND devices, if this is advantageous. The utility of these PNDs is mainly manifested in their ability to determine the path between the first location (usually, the starting or current location) and the second location (usually the destination). These locations can be entered by the user of the device by any of a wide variety of different methods, 141 719.doc 201104224, for example, by postal code, street name and house number, previously stored "well known" destinations (such as famous locations, municipal locations (such as stadiums or swimming pools) or other points of interest) and favorite destinations or destinations that have been recently visited. Chang, Cong has the function of calculating the "best" or "best" path between the starting address location and the destination address location based on the map data. The "best" or "best" path is based on Predetermined criteria to determine and not set to the fastest or shortest path. The choice of path along which the driver is directed can be very complex, and the selected path can take into account existing, pre-listed, and dynamic and/or wireless reception. Traffic and road information, historical information about road speed, and driver's own preferences for determining road alternatives (eg '(4) Qualified routes should not include highways or toll roads.) PND can be hidden (four), making The actual journey time can be recorded and fed back to more accurately predict how the journey time changes at different times of the day depending on the usual weights of traffic flow. In addition, the (4) pieces can continuously monitor roads and traffic conditions, and provide or choose to change the path due to changing conditions, on which the remaining journey will take place. Instant traffic monitoring systems based on various technologies (e.g., mobile phone data exchange, stationary camera, GPS fleet tracking) are being used to identify traffic delays and feed information into the notification system. This type of gang can usually be mounted on the dashboard or windshield of the vehicle's but can also be formed as part of the onboard computer of the vehicle's radio or as part of the control system of the vehicle itself. The navigation device can also be part of a handheld system, such as a ship (a digital camera, 141719.doc 201104224), a media player, a mobile phone, or the like, and in these cases, the conventional functions of the handheld system The functionality is extended by mounting the software on the device to perform path computations and navigation along the calculated path. Path planning and navigation functionality can also be provided by desktop or mobile computing resources that operate on appropriate software. For example, the Royal Automobile Club (RAC) is in the online route planning and navigation facility, which allows the user to key the starting point and destination, so the user's pc is connected to the brigade calculation-path (state The user can be assigned a map and generate a detailed navigation command for directing the user from the selected starting point to the selected destination. The facility also provides a pseudo-three-dimensional representation of the calculated path and a credit-to-function, which graphically simulates the user's intentionalization and provides the user with a preview of the calculated furnace. In the case of the second D, once the path is calculated, the user interacts with the navigation device to select the desired calculated situation from the list of proposed paths as appropriate, and the user can intervene or direct the path selection process, such as By specifying for a particular journey, certain paths, roads, and bit criteria should be avoided or must be followed. The path calculation aspect of the PND forms the main function, and navigation along this path is another major function. During the navigation of the calculated path, these pNDs often provide an audible or audible command to direct the user along the selected path to the end of the road, i.e., the desired destination. Map information is also often displayed on the screen during navigation [this information is regularly updated on the screen] so that the displayed map information indicates the current location of the device and therefore 141719.doc 201104224 represents the user or user's vehicle Current location (if the device is being used for navigation within the vehicle). The icon displayed on the screen usually indicates the current device position and is centered. The map information of the current and surrounding roads near the current device location and other map features are also displayed. In addition, depending on the situation, the map information can be displayed. The navigation information is displayed in the status bar above, below or on one side. Examples of the navigation information include the distance from the current road that the user needs to select to the next deviation, the nature of the deviation, which may be indicated by the specific type indicating the deviation ( For example, a left-turn or a right-turn) is represented by another icon. The navigation function also determines the content, duration, and timing of the voice commands by which the user can be guided along the path. As you can see, simple instructions such as "just turn left and then turn left" require a lot of processing and analysis. As previously mentioned 2, the user's interaction with the device can be by touch screen, or (in addition or in addition to) by a steering column mounted remote control, by voice activation or by any other suitable method. = In the case of another important road service provided by the device, the user deviates from the previous calculation during the navigation (accident or intentional). · Instant traffic condition indicates an alternative. Only the device can automatically recognize this. Wait for conditions, or when for any reason actively cause the device to perform path recalculation. Since the user is also known to allow per-user defined criteria: the user may prefer to calculate the rainbow by the device, for example, to avoid traffic jams that may occur, pre-event/to' or may wish for a road. The device software will follow any of the various paths that have occurred in the field or in the field, and prefer to follow the path 141719.doc 201104224 / the most number is marked as (for example, a point of interest with a beautiful view (called POI) ^ or use the indication of the traffic conditions that are occurring on a particular road. The calculated route is sorted by the possible blockage or the degree of delay due to the blockage. Other POI-based and traffic-based information and navigation guidelines are also possible. Although the path juice calculation and navigation functions are important for the overall utility of the PND, the device can be used purely for information display or "free driving", which only shows map information related to the current device location, and 1 has not yet been The leaf calculates the path and the device is currently not performing navigation. This mode of operation is often applicable when the latter is known to travel along the path and does not require navigation aids. The above types of devices (for example, 720T by TomT〇m Internationa I B v = and supplied) A reliable means for enabling a user to navigate from one location to another. The limitation of navigation and/or path planning devices is that path planning is such that the use of appropriate path selection criteria (such as attempting to minimize the main "cost" parameters such as travel time or total distance while landscape wins Or a scenic walking path or a destination location that is different from the location of the nearby interest point. This is known to be a navigational path to the familiar path of the various types of path planning devices. The most appropriate path of pain is very useful and the route can be extremely useful. However, visitors may often need to calculate the sightseeing route that starts and ends at the same location (such as the hotel where the tourist is located) (by vehicle location and purpose) When the location is the same, one of them is Feng Wu, and the commonly used road 1417I9.doc 201104224 path planning algorithm is invalid. For the first time, some advanced navigation devices are installed from (for example) websites or straight. Yi, he subscribes to the pre-calculated itinerary obtained by the private supplier. However, this is 妒σ _ 仃耘 仃耘. The quality depends on the third-party supplier, and Privately, this is not available for all alliances. Destroy. π male V, interesting points. There is no fine-tuning of pre-emptive facilities based on the preferences of individual users, and there is no suitable for making the itinerary A facility with a specific travel time or distance. The present invention has been devised in mind of the above problems. [Invention] The aspect of the invention is defined in the scope of the patent application. In summary, one aspect of the invention provides a method for calculation A technique for a path from a departure location to a destination location. The route passes through one or more attractions that represent a sightseeing attraction. The departure location and the destination location may be the same or different from each other. The digital database lean source contains digital map information, the digital map information includes a plurality of scenic spots. The technology includes one or more of the following: (a) determining an initial from the departure location to the destination location a path, and setting the initial path as the current path; (b) determining, for each of the candidate points of the one of the attractions, a view depending on the attraction and the current road a relative attraction value of a distance between the paths; (c) which location corresponds to a maximum attraction value; (d) modifying the current path to include the pair of points determined at step (c) Steps (b) through (d) may be repeated one or more times to iteratively calculate the 141719.doc -10- 201104224 path. The advantage of the above technique is that 'the starting position and the destination position are Different or different. If the same, the initial path may be a dummy path with a path length of zero, for example, from the departure location to the destination location, or an initial experimental route near a common departure/termination location. (PUQt ei (10)it) - Modify the dummy path to extend to one or more of the attractions, and the clockworker updates the road with more thoughtful path information. The invention thus permits automatic calculation of the sightseeing route even if the sightseeing route begins and terminates at the same location. The technique can also have a path cost limit, for example, a value that can be set by the user - or multiple values. Path cost refers to any parameter used to determine path performance, and for example, parameters that are normally expected to be minimized in other path computation techniques. The example path cost parameter may include (without limitation) any of the following: path distance; estimated travel time, financial cost of the road control (eg, in terms of spent fuel and/or tolls) Cost limits, rather than trying to minimize costs, the technology can form a less restrictive sightseeing path that is less restricted by conventional path computation techniques. The technique can also use an attractive value for each attraction, the attraction value indication A relative weighting or "score" that indicates the fullness, sex, or desirability of visiting the attraction. The relative attraction can be increased by increasing the attractiveness of the individual attractions. The function of the present invention is to absorb the force value. Another aspect of the present invention provides a technique for calculating a path from a departure position to a destination location of I4I719.doc -11 - 201104224, the path passing through each representation One of the attractions or attractions. A digital database resource contains digital map information, including multiple attractions. The technology includes one or more of the following: (4) The user-received input information defining a cost limit for the path (for example, the cost limit includes, depending on the case, a selection from a small one: - a path distance limit; a travel time limit, each one); Determining a candidate attraction to include in the calculated path; (C) calculating an additional cost of modifying the calculated path to include the candidate attraction; (4) selectively only at the additional cost The case where the path cost exceeds the cost limit T is modified to calculate the pure money package (four) candidate spots. The other aspect of the invention provides a kind of calculation - after each representation ------- small - A technically-recognized database resource containing digital maps containing digital map information, the digital map contains a number of attractions. The technology includes one or more of the following: (a Receiving, from a user, input information defining a departure position using the 孓4 path and at least one selection criterion for the path; (8) executing the path based on the at least-selection criterion to calculate the path from the departure position extend, After passing through (4) the sights' and returning to the starting position. Even though the invention is extended to independently cover the above, any two or more of the above aspects can be combined by 141719.doc 201104224 </ RTI> </ RTI> </ RTI> </ RTI> </ RTI> <RTIgt; </ RTI> </ RTI> <RTIgt; </ RTI> </ RTI> </ RTI> The present invention will be described with reference to the accompanying drawings, by way of illustrative example, and the embodiments of the teachings of the invention. Preferred embodiments. However, it should be borne in mind that the teachings of the present invention are not limited to PNDs, but are generally applicable to any type that is configured to execute navigation software to provide path planning and/or navigation capabilities. Processing the device. Thus, it can be seen that, in the context of the present application, the navigation device is intended to include, but is not limited to, any type of path planning and navigation, whether the device is embodied as a PND, navigation built into the vehicle. The device is actually embodied as a computing resource that performs path planning and/or navigation software (such as a desktop or portable personal computer (PC), a mobile phone, a client-server system, or a portable digital assistant ( PDA)). The preferred embodiment implements a technique for calculating a path from a departure location to a destination location through one or more attractions each representing a sightseeing attraction. The departure position and the destination position may be different from each other, but one of the salient features of this embodiment is that the path calculation technique can be applied even when the departure position and the destination location are identical to each other. This calculation can use - "cost limit", and the path is 141719.doc -13· 201104224. For example, the cost limit can be a distance limit and/or a travel time limit. Unlike the conventional path planning method, which does not seek to minimize this cost, the technology seeks to count the 'sightedness (or "attraction") within the set cost limit. Sightseeing path. λ汁# can also use the following technique: setting an initial path to a current path, and evaluating the relative attraction value of one or more attractions depending on a distance between the current path and the attraction' determining which attraction causes the maximum Relative attraction value, and the path is modified to include the attraction (as appropriate, if the additional cost of modifying the path does not exceed the cost limit). The path can be formed iteratively using techniques such as δ Xuan. Figure 1 illustrates an example view of a positioning system that can be used by a navigation device. The example location system is Global Positioning System (GI&gt;S), which is known and used in various categories. However, many other types of positioning systems can be used as needed. For example, based on satellites and/or radios, GPS is a navigation system based on the radio, which is capable of determining continuous position, speed, and for an unlimited number of users. Time and (in some cases) direction information. The GPS, previously called NAVSTAR, incorporates a plurality of satellites orbiting the Earth in extremely precise orbits. Based on these precise orbits, GPS satellites can relay their position to any number of receiving units. The GPS system is implemented when a device specially equipped to receive GPS data is used to start scanning the RF for the Gps satellite nickname. After receiving a radio frequency from a GPS satellite, the device determines the exact location of the satellite via one of a number of different conventional methods. In most cases, the device will continue to scan the signal until it has acquired at least three different satellite signals. 141719.doc •14· 201104224 (Note that other two-angle measurement techniques can be used to determine by only two signals. Location, although this is a very example). After performing the geometric triangulation, the receiver uses its two known locations to determine its own two-dimensional position relative to the satellite. This determination can be made in a known manner. In addition, the acquisition of the fourth satellite signal will allow the receiving device to calculate its three-dimensional position in a known manner by the same geometric calculation. The position and speed data can be continuously updated in real time by an unlimited number of users. As shown in Fig. 1, the GPS system is generally indicated by the reference numeral 1〇〇. A plurality of satellites 120 are in orbit around the earth 124. The obscuration of each satellite is not necessarily synchronized with the orbits of other satellites 120, and is actually likely to be different. The GPS receiver M0 is shown receiving a spread spectrum GPS satellite signal 160 from various satellites 12 。. The spread spectrum satellite signal 16 continuously transmitted from each satellite 120 utilizes a highly accurate frequency standard achieved by an extremely accurate atomic clock. Each satellite 120 transmits a data stream indicative of the particular satellite 120 as part of its data signal transmission 160. Those skilled in the relevant art will appreciate that the GPS receiver device 140 typically acquires a spread spectrum Gps satellite signal from at least three satellites 12 for the GPS receiver device 14 to calculate its two dimensional position by triangulation. The acquisition of additional signals, which cause a signal 160 from a total of four satellites 12, permits the GPS receiver device i 40 to calculate its three dimensional position in a known manner. 2 is an illustrative representation of an electronic component of a navigation device 2〇0 in accordance with a preferred embodiment of the present invention in a block component format. It should be noted that the block diagram of the navigation device 200 does not include all components of the navigation device, but only

141719.doc _ L 201104224 End of the sample component. The navigation device 200 is located within a housing (not shown). The housing includes a processor 210 coupled to an input device 22 and a display screen 240. Input device 220 can include a keyboard device, a voice input device, a touch panel, and/or any other known input device for inputting information; and display screen 240 can include any type of display screen, wLCD displays. In a particularly preferred configuration, the input device 220 and the display screen 24 are integrated into an integrated input and display device. The integrated input and display device includes a touch pad or touch screen input, so that the user only needs Touching one of the display screens 240 can select one of a plurality of display options or launch one of a plurality of virtual buttons. The navigation device can include an output device 26, for example, an audio output (e.g., a speaker). Since the output device 26 can generate audio information for the user of the navigation device, it should be equally understood that the input device can also include a microphone and software for receiving input voice commands. In navigation device 200, processor 21 is operatively coupled to input device 220 via connection 225 and is configured to receive input information from input device 22A via connection 225 and operatively coupled to display screen 240 via output connection 245 And outputting at least one of the devices 26A to output information to the at least one. Additionally, processor 210 is operatively coupled to memory resource 230 via connection 235 and further adapted to receive information from input/output (1/〇) 270 via connection 275/to send information to the input/output (1) /〇)埠27〇, where 1/〇蟑270 can be connected to the 1/0 device 28〇 outside the navigation device 200. Memory resource 230 includes, for example, volatile memory (such as random access H37J9.doc • 16 - 201104224 δ recall (RAM)) and non-volatile memory (eg, digital memory, such as = flash memory) body). External pottery pieces may include, but are not limited to, external listening pieces such as earpieces. The connection to the syllabus may additionally be: a wired or wireless connection of another external device (such as a car stereo unit), for example for hands-free operation and/or for voice-activated operation, for use in an earpiece or headset Connection of the headset and/or for example to a connection to a mobile phone, wherein the mobile phone connection can be used to establish a data connection between the navigation m2_, for example the Internet or any other network, and/or to (for example) the Internet or some other network established to write to the word service. 11 . . Figure 2 further illustrates the operative connection between the processor (4) and the antenna/receiving state 250 via connection (5), wherein the antenna/receiver (10) can be, for example, a GPS antenna/receiver. It will be understood that the antenna and receiver, indicated by reference numeral 250, are schematically combined for purposes of illustration, but the antenna and receiver may be configured to open a 1-inch component, and the antenna may be, for example, a Gps chip antenna or a helical antenna. Additionally, those of ordinary skill in the art will appreciate that the electronic components illustrated in Figure 2 are powered by a power supply (not shown) in a conventional manner. As will be understood by those skilled in the art, it is believed that the different configurations of the components shown in Figure 2 are within the scope of the present application. For example, the components shown in Figure 2 can be in communication with one another via wired and/or wireless connections and the like. Thus, the scope of the navigation device 200 of the present application includes a portable or handheld navigation device 200. In addition, the portable or handheld navigation device of FIG. 2 can be connected in a known manner 141719.doc 17 201104224 or "Connect" to a vehicle such as a bicycle, a bicycle, a car or a ship. This navigation device 200 can then be removed from the cohesive location for portable or handheld navigation purposes. Referring now to Figure 3, the navigation device 2 can be used to establish an "action" or telecommunication network with the feeder 3G2 via a mobile device (not shown) such as '(4) telephone, PDA and/or any device with mobile phone technology) Connected to establish a digital connection (such as 'via a digital connection via known Bluetooth technology, then (4) the device can establish a network connection with the server 302 via its network service provider (eg, via the Internet) The network thus establishes an "action" between the navigation device 20() (when it travels on its own and/or in a manner in the vehicle, which can be and often acts) and the server 3〇2 Network connections to provide "instant" or at least "new" gates for information. For example, the Internet (such as the World Wide Web) can be used in mobile devices (via service providers) in a known manner. The establishment of a network connection between another device, such as server 3〇 2. This may include, for example, the use of a Tcp/ip layered protocol. The mobile device may utilize any number of communication standards, such as 'CDMA, GSM, WAN, etc. Thus, an internet connection can be made, for example, via a data connection, via a mobile phone or a mobile phone technology within the navigation device 200. For this connection, a server 302 and navigation device 2 are established. Internet connection between 。. For example, it can be connected via a mobile phone or other mobile device and GPRS (Integrated Packet Radio Service) (GpRS connection is a high-speed data connection for mobile devices provided by telecom operators; 〇1 &gt; 118 is used to connect J4I7l9.doc -18- 201104224 to the Internet. This establishment. The navigation device 200 can be further implemented and implemented in a known manner via, for example, existing Bluetooth technology. The data is connected and eventually completes the data connection with the Internet and server 302, wherein the data agreement can utilize any number of standards, such as GSRM, the data protocol standard for the GSM standard. The navigation device 200 can be in the navigation device 2 〇 itself includes its own mobile phone technology (including, for example, an antenna, or, as the case may be, using a navigation device The mobile phone technology within the navigation device 200 can include internal components as specified above, and/or can include an insertable card (eg, a user identity group or SIM card) that is The necessary mobile phone technology and/or antenna. Thus, the mobile phone technology within the navigation device 2 can similarly be established between the navigation device 2 and the server 302 via, for example, the Internet. The network connection is built in a way similar to any mobile device. ° For GPRS phones, the 'Bluetooth-enabled navigation device can be used to work correctly with the ever-changing spectrum of mobile phone models, manufacturers, etc.' The t'model/manufacturer specific design can be stored on the navigation device 200. The information stored for this information can be updated. In FIG. 3, navigation device 200 is depicted as being in communication via a general communication channel 318 server 302, which may be implemented in one of several different configurations. When the connection between the server 3〇2 and the navigation device 2〇〇 via the communication channel 318 is established (note that the connection may be a data connection via a mobile device, a direct connection via a personal computer via the Internet, etc.) At the time, the server 302 can communicate with the navigation device 2A. 141719.doc • 19· 201104224 The server 302 includes (in addition to other components that may not be described) a processor class that is operatively coupled to a memory port and further operates via a wired or wireless connection 3 14 Optionally connected to the large-capacity data storage device 312»processors 〇4 step-by-step operatively coupled to the transmitter 308 and the receiver 310 to transmit information to the navigation device 200 via the communication channel 318 and to be transmitted from the navigation device fan News. The signals transmitted and received may include data, communications, and/or other propagating signals. The transmitter and receiver 31G can be selected or designed in accordance with the communication requirements and communication techniques used in the communication design of the navigation system 200. Additionally, it should be noted that the functions of transmitter 308 and receiver 31 can be combined into a single transceiver. Server 302 is further coupled to (or includes) a large capacity storage device 312. Note that the mass storage device 312 can be coupled to the feeder 302 via communication link 314. The mass storage device 312 contains storage of navigational data and maps, and may also be a separate device from the server 3〇2 or may be incorporated into the server 302. The navigation device 200 is adapted to communicate with the server 3 via the communication channel 318 and includes a processor, memory, etc. as previously described with respect to FIG. 2, and to transmit and receive signals from the channel #38. And/or transmitters 32 and receivers 322, it is noted that such devices can be further utilized to communicate with devices other than servos 302. In addition, the transmitter 320 and the receiver 322 are selected or designed according to the communication requirements and communication technologies used for the navigation device 2, and the functions of the transmitter 320 and the receiver 322 can be combined. As a single transceiver. The software stored in the server memory 306 provides instructions 141719.doc 201104224 to the processor 3 〇 4 and allows the server 302 to provide services to the navigation device 2 . One of the services provided by the server 302 includes processing the request from the navigation device 2 and transmitting the navigation data from the large-capacity data storage 3 12 to the navigation device 200. Another service provided by the server 302 includes the desired The application uses various algorithms to process the navigation data and send the results of such calculations to the navigation device. The communication channel 318 generally represents the propagation medium or route connecting the navigation device 2 to the server 3〇2. Both server 302 and navigation device 2 include a transmitter for transmitting data via a communication channel and a receiver for receiving data that has been transmitted by the communication channel. Communication channel 318 is not limited to a particular communication technology. In addition, communication channel 318 is not limited to a single communication technology; that is, channel 318 can include several communication links using various techniques. For example, communication channel 3 18 can be adapted to provide a route for electrical, optical, and/or electromagnetic communication, and the like. Thus, communication channel 318 includes, but is not limited to, one or a combination of the following: circuits, electrical conductors such as wires and coaxial cables, fiber optic cables, converters, radio frequency (RF) waves, atmosphere, white space ( In addition, communication channel 318 can include intermediate devices such as router repeaters, buffers, transmitters, and receivers. In an illustrative configuration, communication channel 318 includes a telephone network and a computer network. The communication channel 318 can be adapted for wireless communication such as radio frequency, microwave frequency, infrared communication, etc. The communication channel 318 can be adapted for satellite communication. The communication signals transmitted via the communication channel 318 include, but are not limited to, I417I9. Doc 21 201104224 To determine the signals required or required by the technology. For example, these t numbers can be used for cellular communication technologies (such as time division multiple access (TDMA), frequency division multiple access ( FDMA), code division multiple access (cdma), Global System for Mobile Communications (GSM), etc. Both digital and digital signals can be transmitted via communication channel 318. These signals It may be a modulated, encrypted, and/or compressed signal that may be desirable for communication technology. The feeder 302 includes a remotely accessible feeding device H that can be accessed by the navigation device 2 via a wireless channel. 3〇2 may include a web server located on a local area network (LAN), a wide area network (WAN), a virtual private network (vpN), etc. The server 302 may include, for example, a desktop or laptop computer. The personal power monthly and overnight channel 318 can be a cable connected between the personal computer and the navigation device 200. Alternatively, a personal computer can be connected between the navigation device 2 and the server 302 to establish a medium. An internet connection between the server 3〇2 and the navigation device 2〇〇. Alternatively, a mobile phone or other handheld device can establish a wireless connection to the Internet for connecting the navigation device 200 via the Internet. To the server 3〇2. The navigation device 200 can be provided with information from the server 3〇2 via the information download, and the information download can be automatically updated periodically, or updated after the user connects the navigation device 200 to the server 3〇2. And/or in the (a) column For example, the wireless mobile device and the tcp/ip connection are updated in a more dynamic manner after a relatively continuous or frequent connection is established between the server 302 and the navigation device 2〇〇. For many dynamic calculations, the processor 3〇4 in the server 302 can be used to handle a large amount of processing needs, however, the processor 21 of the navigation device 2 can also handle many processing independently from the connection to the server 302 from time to time. And calculations. H1719.doc -22- 201104224 As indicated above in FIG. 2, the navigation device 200 includes a processor 210, an input state device 22, and a display screen 24. The input device 22 and the display screen 240 are integrated into an integrated input and display device to enable, for example, information input via a touch panel screen (via direct input, menu selection, etc.) and information display. As is well known to those skilled in the art, the screen can be, for example, a touch input LCD screen. Additionally, the navigation device 2A can also include any additional input device 22 and/or any additional output device 24 1, such as an audio input/output device. 4a and 4b are perspective views of the navigation device 2''. As shown in FIG. 导航, the navigation device 200 can be an integrated input and display device 29 (eg, a touch panel screen) and other components of FIG. 2 (including but not limited to an internal GPS receiver 250, a microprocessor Unit of 21〇, power supply, memory system 230, etc.). The navigation device 200 can be located on the arm 292, which can be fastened to the vehicle dashboard/window/etc. using the suction cup 294. The arm 292 is a connector station. The navigation device 200 can be coupled to the docking station. As shown in Figure 4b, for example, the navigation device 2 can be coupled or otherwise coupled to the arm 292 of the docking station by attaching the navigation device 200 to the buckle of the arm 292. The navigation device 200 can then be rotated on the arm 292 as shown by the arrows in Figure 4b. For example, to release the connection between the navigation device 2 and the docking station, the button on the navigation device 2 can be pressed. Other equally suitable configurations for coupling a navigation device to a docking station and decoupling the navigation device from the docking station are well known to those skilled in the art. Alternatively, the navigation device 200 can be used in a portable mode outside the vehicle, for example, for a user walking or otherwise traveling (such as riding a bicycle) for 141719.doc -23- 201104224 to calculate and navigate the walking path . Referring now to Figures 5 and 6 of the accompanying drawings, the memory resource 23 stores a boot loader program (not shown) that is executed by the processor to load from the memory resource 230. An operating system 47 is configured for execution by the functional hardware component 460, and the operating system 47 provides a working environment for the application software 48. The operating system 470 is used to control the functional hardware component 46 and reside between the application software 480 and the functional hardware component 46A. The operating system 47 〇 can provide general services to the application software, for example, including maintaining the current time and the sfl. The application software 480 provides a work environment that core functions of the Begun navigation state 200, such as map view, path gauge S'J, navigation functionality, and any other functionality associated therewith. The memory resource 230 also stores a digital map database 5, which is used by the application software 480 to generate a map view and calculate a navigation path. The digital map database 500 includes information defining roads, building-intensive areas, terrain types, heights, points of interest, and/or attractions. The digital map library 500 can be stored together or stored in separate database modules, and several different components (inf〇rmati〇n plus). As illustrated in Figure 6, the digital map database 5' is illustrated as having a map graphic component 502 and an attractive component 504. Referring to Fig. 7, the map graphic component 5〇2 is represented as a set v of vertex v and a set of directed edges α E connecting the respective vertices. The equal sides represent, for example, roads or sidewalks, and the vertices indicate, for example, a change in direction and indicate a junction when connected to more than two sides. The calculated road control is expressed as one of the starting points in the equilateral side. 141719.doc •24· 201104224 One or more of a destination location (the ground vertex that the destination (starting vertex) extends through one or more intermediate vertices) One of the sequences of the sides. "Attraction component 504 represents a tourist attraction (or 2 points) that may be of interest to the visitor). A collection of information that represents attractiveness (also referred to herein as an attraction) may include at least some of the so-called points of interest that have been stored in the digital map database. However, points of interest may also include such as: The parking area and other useful information that is not attractive to sightseeing. Therefore, the collection of attractions and the collection of points of interest in the attraction component 504 can form an at least partially overlapping set of information, and (4) the possible difference Each may be represented independently of the other. The information in the attraction database component 504 may be obtained from a third party authoritative source 5〇6 (such as the issuer of the electronic travel guide information) or by a third source. 5〇6 Supplement. In Figure 7 'describes attractions 522 to 536, which include castle cut to 526, forests 528 and 53 〇, rivers and river banks 534 and wetland habitats (5) _ habitat 536 ° in the attraction database component 504 Each attraction indicated includes an attractive category and/or attraction value, as appropriate. For example, the class of attraction can distinguish between ruins (for example, castles and chateau); memorials; museums; forests; picnic areas; play areas; river banks; This is merely a non-exhaustive list of the principles used in this embodiment. A much larger or smaller number of categories can be implemented as needed. One or more categories can also be reclassified hierarchically to provide a more granular classification of attractiveness. A single attraction may suitably belong to a plurality of categories. It is also possible to group or associate a plurality of points to visit as a whole (even if there is a difference between 141719.doc •25·201104224). If implemented, the use of the appeal category allows the user to decide which type of attraction he or she wants to visit, and can exclude the attractive categories that the individual user is not interested in. However, some embodiments may provide for a lesser category if not required. The attraction value may indicate an approval score, which is usually graded as a sightseeing attraction by the recognition score. For example, the attractiveness value may be based on feedback from the visitor, feedback from other users of the navigation/path planning system, or a summary of the user's own visit to the attraction component. Give feedback. In Figure 7, the castle 522 has a relatively high attraction value of 75, the castle 524 has a higher attractive value of 8 inches, and the castle 526 has a moderately attractive value of 4 inches. Forest 528 has an attractive value of 2〇, while forest 530 is not graded. Unrated attractions can be considered to have any predetermined preset or initial attraction value, for example, one (1) or one. If implemented, the use of attractiveness values can allow more desirable attractions to be weighed to be more favorable for participation. It should be understood that in some embodiments, the attractiveness value may be omitted or may be made equal for all attractions. Referring to Figure 6, path planning stage 510 uses information from digital map database 5 and user preference input 508 to calculate a path 512 for sightseeing attractions (attractions) based on user preferences. In the present embodiment, device 200 includes a navigation stage 5 14 for immediately directing a user (e.g., driving, cycling, or walking) along the path. The journey is recorded and information identifying which attractions have been visited can be fed back to the Attraction Library component 504 (as shown at 5 16). As explained later in the following, this information can be useful for enabling the user to calculate a second path for a site that has visited 141719.doc •26·201104224 for another time or another day. Figure 8a on the left, the principle of this embodiment for calculating a sightseeing route will now be explained. The preference 08 is to prompt the user to type or define the user's criteria for the sightseeing route or to select from the path criteria. Referring to the figure: , - The input parameter can be the "cost" limit of the path. As used herein, the term "cost for cost" is used to indicate any parameter, and in other paths, the system may attempt to minimize this parameter as an undesirable amount. Examples of costs include travel time and/or travel distance. In addition or in addition, financial costs (e.g., 'road tolls and cost of fuel consumed' may be used'' but the term "cost" is not limited to financial costs. In Figure 10, the user can select the travel time, but depending on the implementation, the distance limit and/or financial cost can be typed as needed. If a plurality of input parameters are provided, then the user can make some parameters empty if the user decides not to impose restrictions on the individual parameters. The user may have to enter at least one valid cost limit, or one or more pre-set or preset cost limits may be assumed by the navigation device 200 if the user has not entered their own limits. For example, the preset cost limit may include a preset distance limit (eg, km) and/or a preset duration limit (eg, 2 hours). Still at step 508, another input parameter (not shown) that the user may type is used to select the category of attraction to be visited and/or one or more categories that need to be excluded from the tour. Users can also be prompted to choose whether to impose restrictions on the attractiveness of the attractions that need to be viewed. For example, the user may choose to exclude attractions having an attraction value less than a certain threshold, for example, excluding attractions having a value less than ten. It can also prompt the user whether to exclude the recent 141719.doc •27- 201104224 visited the brother It e L, the operation point. As mentioned above, when attracting y? 粗 由 1 田 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 景点 。 。 。 。 。 。 。 。 You can visit other attractions during the follow-up sightseeing trip. / view' so that at the step 508, the other input "" demon" road light starting position 窨 s" and the destination position "d ^ H ^ " may be different, but one of the members of this embodiment The feature is that the road 彳 a gauge #丨ϋ έ &amp; 峪 only the planning module permits the starting position "s" 盥 」" position "d" is the same if necessary. For example, the user can start and end the light path at a location (where the location indicates his or her hotel). After step 508, the process proceeds to step 550 of initializing - route list p, which will indicate the calculated path. The path is represented as a sequence or list of connected segments, each of which is referred to herein as a route "P". Referring to Figure 9a, each route is represented by at least one initial vertex %], at least one terminating vertex 564, joined by one or more edges and intermediate vertices 566. All index values of the vertices and edges can be stored as part of the route' or some value can be assumed. For example, it can be assumed that the initial vertex 562 is the same as the ending vertex of the previous route (not shown) because the routes are continuous with each other. The route list needs to be initialized because the technique of the present invention is used to iteratively form the path. This iterative method needs to define an initial path or a pilot path (or even a dummy path) on which iterations can be established to expand or expand the path within the path cost limits set by the user based on the user's preferences and Its visit to the sights. It is also necessary to be able to use the same path planning algorithm to form a sightseeing route that can be applied to the same or different departures. 141719.doc • 28- 201104224 Location and destination location of the sightseeing route β Step 550 includes comparing the departure location, and the destination location “dj, The cans determine whether they are the same initial step. If the two positions are not the same, the bristles proceed to the step 574, and at step 574, the "practical path" function is implemented (eg, called p/a„path ) to calculate the starting route, the initial route to the destination d, which has nothing to do with the scenic spots. Typically, the path planning function assists in finding the most appropriate path to minimize the cost (such as distance or travel time). These conventional functions are well known to those skilled in the art of navigation and road planning devices and need not be detailed here; - Generally speaking, the path planning function can plan a minimum cost route (6) between the two vertices contained in the field, which is from one or more edges of E and optionally from R - or multiple intermediates Vertex composition. The path planning function may also include the cost "I" by the cost parameter, the distance calculation path, or each time the calculation - the new ::: can be called the cost calculation function. Either one of the above is advantageous in that the cost of a route (or path segment) can be calculated and stored as a parameter of the individual route or a parameter associated with the respective route. The route list then contains only information about the vertices and edges of the route, and also contains the route cost for the $an associated parameter. This enables an analysis of the individual impact of the route on her cost of road control&apos; and also enables rapid recalculation of costs if the route is removed from the path. Use the calculated path as the initial (experimental) route that is stored in the route list. The "cost" of this initial path is calculated after step 576 and compared to the cost limit entered at step 508 (e.g., total travel time and / 141719.doc • 29.201104224 or distance). If the cost of the initial path exceeds the cost limit "", the algorithm ends. Because the initial (four) path does not even satisfy the cost = degree, it is impossible to send the path to visit the attraction. Alternatively, if the initial road height is high, step 574 may be repeated to attempt to find a satisfaction cost; the generation initial route route' or process may return to step 508, where 2: 508 may prompt the user to increase the cost limit or otherwise select each other. The location of the departure and the location of the destination. If it is determined at step 570 that the departure location is the same as the destination location, then the process _ proceeds through step 572 where the dummy initial route P:: is now: line 凊 early P. As explained above, the dummy initial route generation is provided, and also enables the same-acting algorithm to be used regardless of whether the departure position and the destination position are different. The example dummy initial route has a trailing vertex - S = d. Set the cost "]" to zero. The meaning of this route as a real navigation section may be small, but the algorithm will replace this virtual route by a trip to the site. An example of a virtual route is a short line extending around the departure/destination location. After step 550, the light continues to another initial step of initializing one of the attractions or ==, the set of eight-way sightseeing path sense - the point of the dynamic list. The collection of money is in the following sense: as the process is iteratively performed and the attractions as candidates for the visit are included in the roadblock or excluded from the collection A to remove the individual attractions. Collection A may need to be initialized with all the attractions that can be used to fill the candidate. Collection A is more restrictive than the overall list of attractions stored in the attractions database. Set A may be subject to one or more of the following: 141719.doc • 30· 201104224 Limitation: Step 582: Exclude attractions that do not match the user selection criteria. For example, the preference category selected by the user or the attraction having the attraction value less than the threshold set by the user is not matched; Step 584: Excluding the recently visited attractions (as explained in the text) Step 51 The maximum geometric distance from the initial route, line P, can be calculated within this cost limit compared to the location that would be allowed by the user to define the path cost. And then in the database 504 i includes the attractions within the geometric distance from the distance p. After the initialization steps 550 and 580, the process proceeds to the following main loop steps: from the set A to find and select the most A good attraction 'step 590 (Fig. 85) for expanding the route to visit the attraction; and a step 620 of updating the route list p to expand the route to visit the individual attractions (Fig. 8c). Referring to Fig. 8b, step 590 An initial verification step 5 begins, which verifies that the candidate set A of the candidate attractions is not empty. If the set eight is empty, this means that all candidate attractions have been evaluated 'and because the path calculation algorithm has been completed So the end of the process. In order to find (4) the "best" spots to visit, use the evaluation calculation to evaluate the "relative attraction" as a function of the following values: (1) - the attraction value of the attraction, and (ii) the attraction The distance from the current path or one of the respective vertices V on the current path. The relative attraction function increases as the attraction value of the attraction increases (linear or non-linear). Relative attraction function with distance Increase and decrease (line I(10) linearly). Relative suction 5 函数 function therefore 1417l9.doc •31 · 201104224 provides not only depends on the degree of interest in visiting the attraction but also depends on how far the path will have to deviate Visit the attraction of the attraction. The relative attraction between a vertex location V and an attraction a can be expressed as ·, '加)=今肖8{〇,v) where fattr(a) is the attraction of attraction a The value (or a function of the attraction value), and g(a,v) is a function of the distance between the vertex v and the position of the attraction a or gQ, the distance between the vertex v and the position of the attraction a. For example, the illusion can be the Euclidian or Earth distance between madness and v. Alternatively, for greater accuracy, g(a, V) may be the calculated path length between 3 and 沿着 along one or more edges E. As can be seen from π, the above calculation is based on the - vertex position v, not the entire path. Thus, the calculation is repeated for a given attraction a' for each vertex v along the current path defined by the route list p to be evaluated for the entire path. The current (four) can be divided into one piece or one of the materials "卩"

: column 'and thus repeat this calculation for each vertex V in each route p for the route list. The goal is to find which scene produces the highest relative attraction = which of the current paths - the vertices. The evaluation variable F - a continuous record of the maximum value of the relative attractiveness of the vertex for the purpose of comparison = is calculated. The evaluation variable Fa is initialized at step 594 to: repeat the calculation of relative attraction in a series of nested loops indexed for different variables: "Loop step 596/61: for candidate attractions Each of the attractions in the collection A is: 141719.doc • 32- 201104224 Loop Steps 600/608: for each route "P" in the route list p; and loop step 602/606: for the steps along Each vertex "V" of the route "Ρ" selected in 6〇〇. After each such loop is passed, step 6〇2 performs the calculation of faurv for the different values of "V" and "a" defined by the loop index. Step 6〇4 compares the new calculated fattr,v with the evaluation variable Fatu max to identify whether the newly calculated fam’v exceeds the previous maximum stored as Fattrmax. If the newly calculated fam,v is large, the process continues through step 612, where new is used. The calculated value updates the value of Fattr,max; sets an attraction index amax with the value of "a" identifying the attraction that generates the new maximum relative attraction, and uses the point of view of the attraction 3, relative to the route list p Which route p produces a new maximum relative attractiveness value sets a route index pmax. The loop is incremented in a nested manner at steps 6〇6 to 61〇, after which step 590 is completed and the process proceeds to step 62〇. After the completion of step 59, the attraction index amax identifies which attraction "a" from the set a of candidate spots causes the maximum relative attraction, and the route index ρ_ indicates which route the attraction "is on the route list P" "p" produces the greatest relative attraction. The principle of step 620 will be explained first, followed by a detailed description of step 620 (Fig. 8 (see Fig. 9a, illustrating an example attraction amax positioned to the closest route Pmax that results in the greatest relative attraction. Route pmax from route ρ_χ The first vertex 562 extends along one or more sides and intermediate vertices 566 to the last vertex 564 of the route Pmax. Referring to Figure 9b, the principle of step 620 is to generate two new candidate routes ~ - and ^ " ' these new Candidate Route Pbe—and 141719.doc -33- 201104224 pafter extends the path to visit the scene samax. The route pbef〇re extends from the previous first vertex 562 to the new vertex 568 at the attraction amax. The route is from the new vertex 568 (as The first vertex of the route extends to the previous last vertex 564. As can be seen in the figure, the routes may optionally extend over at least one of the leading edges used by !W. The new route can have edges to the same position, except that the new edges are directed and the opposite direction is used in both routes. Then use these new routes pbef〇d... Replace the previous ones in the route list P Route ρ_, This modifies the path to visit the attraction amax. The number of individual routes p in the route list P is increased by one. Referring to Figure 8c, step 62 is shown in detail. At step 622, the path calculation function ·/« is called to calculate from the previous The first vertex 562 extends to the first new candidate route ~ heart at the respective vertex 568 at the attraction. At step _ the re-person call control calculation function recognizes that the calculation extends from the new vertex 568 to the previous last vertex 564 The second new candidate route...Step (iv) Assessment: (1) The change in cost of the route in the case of using two new routes Pbef〇d (8), and (ii) whether the change in cost will result in a more than Explain that it is preferable to maintain the continuous index of cost 1c next to each route P of the monthly single armor, and also maintain the continuous total cost lp of all routes. Also as part of the calculation of the (four) function - cost. Therefore, step 626 includes ·· The Pb_ and Bu costs calculated by the p/aw function are added to the continuous total cost P, and the cost associated with Pmax in the route list is subtracted. The right evaluation at step 626 indicates that the cost limit has not been exceeded. ,then Instructing the U tampering. The Hai path, the new route Pbd can be used. "and Pm" can be used instead, and the Sightseeing Route can be included in the 141719.doc • 34- 201104224 sightseeing route to proceed to step 628, at step 628, The continuous total cost Ip is updated with the new cost. At step 630, the new route Pbef〇re and ~ are inserted into the route list p. The function is called to insert the route into the route π__ at the immediately preceding position. The function is called to insert the route Pafter into the route list at the position immediately after pmax. At step M2, the previous route pmax is removed from the route list. Call the rew〇ve function to remove pmax. This completes the replacement of the previous route ρ· with the new route Pbef〇re and Pafter, thereby expanding the path to visit the attraction. At step (4), because the scene ^ is now in the path, the attraction amax is removed from the collection a of candidate spots. If the evaluation indication at step 626 will exceed the cost limit, then the indication may not modify the path; the new candidate route pbe^p. may not be used. Therefore, you cannot visit the attraction amax on this road &amp; Processing proceeds directly from step 626 to 634 without passing through steps 628 through 632. At step 634, the attraction amax is removed from the collection A of candidate attractions (because the attraction is no longer a candidate attraction; this attraction has been tried but cannot be included in the route without exceeding the path cost limit) ). After step 634, the process returns to step 592 of step 59 to find another best attraction of the set A of candidate attractions. The algorithm is thus repeated until all attractions have been evaluated and included in the path or abandoned (since the extension will exceed the cost limit). Once the candidate candidate A of the remaining candidate attractions is empty, the process ends at step 592.卞 It should be understood that the above technology can calculate a sightseeing route regardless of whether the departure location and the destination location are 141719.doc -35· 201104224. Candidate attractions are evaluated and an iterative process is used to identify a best candidate attraction based on a relative attraction function. A new route is created to extend one of the existing routes to the best candidate attraction, and the new route replaces the existing existing route, including the new route that does not cause the total path cost to exceed the cost limit. Regardless of whether or not a new route is included, the best candidate attraction is removed from the list of candidate attractions for iterative evaluation. Figure 11 graphically illustrates the application of the above variants in a chart showing the nine path calculation stages. In order to avoid obscuring the details, the return route is generally not indicated except for the path completed in the final stage. Each graph illustrates the attractiveness value 650 observed at the selected vertex position (here the most recently added attraction) in vector form. The relative suction force (not depicted (6) depends on these attractive values and depends on the distance of the attraction from the respective apex. The algorithm for selecting the path above may be advantageous for several reasons: (1) Not &amp; Departure The same algorithm can be used if the location and destination locations are the same or different; (H) The algorithm expands or expands an initial or experimental path that has been extended from the departure location to the destination location (if appropriate or even false) And play a role. Therefore, you p people ^) This 5 Hai path already contains a route to the destination, and t does not have to be completed - unknown (four) paragraph is also no need to suspend the shirt - path slaves again heart algorithm can be A stage to verify whether the cost path of the path meets the cost limit imposed by the user; - (The algorithm can be extended from any of the vertices of the path from p, VL Ge self-contained to visit the attraction. Make the guilty enough to use the most appropriate apex I41719.doc • 36 · 201104224 The expansion or expansion of the desired path from the starting point to the destination. Imagine that many modifications of the above algorithms can be used as needed. Multiple alternative algorithms. For example, although the previously described algorithms are based on an iterative method of extending an initial or experimental path (or even a dummy path), the alternative algorithm can be based on the "connection" made after adding each attraction. Where to go down. Decision. Instead of assessing the relative attractiveness of each vertex along the path, the relative attractiveness of the parent remaining candidate is assessed, but the relative attraction is only relative to the location of the attraction that the path was most recently extended to. Single vertices. This simplifies some processing and results in progressive path formation as seen in Figures u to 2B. It should also be understood that while various aspects and embodiments of the present invention have been described above, the present invention The scope of the present invention is not limited to the specific configurations set forth herein, and the scope of the present invention is intended to include all modifications and variations and modifications of the scope of the appended claims. The embodiments described in the reference to GPS, but it should be noted that the navigation device can be used as any GPS for any position sensing technology. Alternative (or indeed, in addition to Gps). For example, the navigation device may utilize other global navigation satellite systems, such as the European Galileo system. Similarly, 'it is not limited to satellite-based, but can be easily used based on the ground. Beacons or any other system that enables the device to determine its geographic location. Additionally, enhanced content for digital maps may be other devices that may not have a self-contained positioning system (such as navigation and/or path planning). Server). For example, several Internet sites are available according to the user's optional 141719.doc •37- 201104224. The following I: two out: the location to the destination location may be planned for no-use positioning. For later use, the invention extends to cover such uses in the context of instant navigation. Soft body also: It is understood that the preferred embodiment is implemented by (for example, the work (4) can be (4) implemented only in hardware (special application integrated circuit)) or practically by a mixture of hardware and software. _, the scope of the invention; should be interpreted as limited to implementation in software orders. Finally, it should be noted that although the specific scope of the claims herein is set forth in the accompanying claims, the invention is not limited to the specific combinations set forth below, but the scope of the invention is extended to include Any combination of features or embodiments of the invention is not specifically recited in the scope of the accompanying claims. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a schematic illustration of a Global Positioning System (GPS); FIG. 2 is a schematic illustration of an electronic component configured to provide a navigation device; FIG. 3 is a navigation device that can be on a wireless communication channel. Figure 4a and Figure 4b are explanatory perspective views of a navigation device; Figure 5 is a schematic representation of the software/hardware hierarchy in the navigation device; Figure ό is used to calculate a sightseeing route A schematic representation of the information flow; Figure 7 is a schematic representation of a digital map containing points of interest that are attractive to sightseeing; 141719.doc •38· 201104224 Figure a ® 8b and Figure for the display of a sightseeing route The connected part of the schematic flow chart '· Processing / Figure 9 a is a schematic diagram showing the use of the route of the U-distribution - Figure 9b shows the new route of using the history of history > A schematic diagram of the route of FIG. 9a; the route cost limit is shown in FIG. 1 as a schematic diagram for enabling the user to input into the screen; and FIG. 11 a to lie are shown on the left side from a recently added attraction vertex view. Continued section. Diagram of the formation of a path and the attraction value vector shown on the right [Main component symbol description] 120 Satellite 124 Earth 140 GPS receiver device 160 Spread spectrum GPS satellite signal 200 Navigation device / Navigation system 210 Processor 220 Input device 225 Connection 230 Memory/Memory System 235 Connection 240 Display Screen/Display Device 245 Output Connection 250 Receiver/Antenna 141719.doc •39- 201104224 255 260 270 275 280 290 292 294 302 304 306 308 310 312 314 318 320 322 460 470 480 500 502 Connected Output Devices Input/Output (I/O) 埠 Connected I/O Devices Integrated Input and Display Devices Arm Sucker Server Processor Memory Transmitter Receiver Large Capacity Data Storage Device / Mass Storage Device / Large capacity data storage cable or wireless connection / communication link communication channel transmitter receiver function hardware component operating system application software digital map tribute library map graphic composition 141719.doc 201104224 504 attractive component 506 third-party authoritative source 508 User preference input 510 path planning level 512 path 514 Navigation Level 516 Information Feedback 522 Castle 524 Castle 526 Castle 528 Forest 530 Forest 532 Attractions 534 Rivers and River Banks 536 Wetland Habitat 562 Initial Vertex / First Vertex 564 End Vertex / Last Vertex 566 Intermediate Vertex 568 New Vertex 141719.doc ·41 ·

Claims (1)

201104224 VII. Patent application scope: 1. A device (200) for calculating a path from a self-starting position to a destination location, the path passing through each representation - one of sightseeing attractions or a plurality of scenic spots 'the device contains : Digital Bunker tribute source (500), which contains digital map information, including multiple attractions; • A processing resource (21〇) configured to: (a) determine (550) - from An initial path from the departure location to the destination location, and setting the initial path as a current path; (b) determining (602) for each of the candidate collections of the attractions - depending on the attraction and a relative attraction value of a distance between the current paths; (c) determining (604, 612) which attraction corresponds to a maximum attraction value; (d) modifying (620) the current path to include the pair in the step (c) A deviation from the attraction at the ball. 2. The apparatus of claim 1, wherein the processing resource is further configured to iteratively modify the current path by repeating steps (b) through (d). 3. The apparatus of claim 1, wherein step (d) comprises removing (634) a sub-step of the attraction determined in step (c) from the candidate set of attractions. 4. The apparatus of claim 1, wherein step (d) comprises the following sub-steps: (dl) determining (622, 624) one of the current path candidate modifications to deviate from the attraction determined at step (c); D2) determining (626) that the candidate modification is included in the current path, in the case of 141719.doc 201104224 5. 6. 7. 8. 9. 10. 11. 12. The cost exceeds a cost positive; (d3) selectively includes (630, 632) the candidate modification in the current path only if the cost limit is not exceeded. The device of claim 4 wherein the path cost is selected to be one or more of: one path distance; one of the path travel times; one of the financial costs along the path travel. The apparatus of claim 4, wherein the processing resource is further configured to receive (5〇8) a user input indicative of the cost limit and store the cost limit. The apparatus of claim 6, wherein the processing resource is configured to repeat steps (b) through (d) until the candidate set of attractions is empty. A device as claimed in claim 1, wherein the relative attraction value is a function that increases as one of the distances decreases. - a device for a member 1, wherein each attraction is associated with a respective weighted relative attraction value indicating that the attraction is visited, and the relative attraction value is increased as one of the attraction values increases The function. = device of claim 1 wherein step (b) comprises calculating the relative attraction value between the attraction and each vertex of the current path. The apparatus of claim 1, wherein the initial path is a dummy path with a cost of zero and a route length of zero if the departure location is the same as the destination location. The apparatus of claim 1, wherein the step (a) comprises the following sub-steps: (4) determining (570) whether the departure position is the same as the destination location; 141719.doc 201104224 (d) selectively determining the departure at step (al) Where the location is the same as the destination location, the (572)-virtual path is used as the initial path; (9) optionally at step (4)), the location is determined to be different from the destination location (574) The initial path from the departure position to the destination location. 13. 14. 15. 16. 17. 18. For example, the device of item 1 of the month, wherein the current path is stored as one or more routes 'the one or more The route defines the connected route from the departure location to the destination location. :: The device of claim U, wherein step (4) comprises a first new route and a first-new road (four) (63Q, 632) - the selected route And the first new route extends from the starting vertex of the selected route to the attraction, and the second new route extends from the attraction to the ending vertex of the selected route. The device of item 1 'subjects the processing resource The step configuration determines (58G) which attractions are originally included in the candidate set of the attraction by the root selection criterion. The device of claim 1, wherein the navigation device of the λ. ^ device is incorporated with a positioning system The device of claim 16, wherein the device is a portable navigation device. A device (20 〇) for calculating a path from a departure position to a destination location, the path being passed through a long time. π 之一 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各 各Doc 201104224 A processing resource (21 0) configured to: (a) receive (508) input information from a user defining a cost limit for one of the paths, the cost limit comprising being selected from the following At least one: a path distance limit; a travel time limit; - financial cost; (b) a determination (590) - a candidate attraction to include in the calculated path; (c) a calculation (626) to modify the calculation Path to make Include an additional cost for the candidate attraction; (d) selectively modify (628 to 632) the calculated path to include the candidate only if the additional cost does not cause the path cost to exceed the cost limit Attractions. 19. 20. A device (2) for calculating a path through one of the representations - one or more attractions of a sightseeing attraction, the device comprising: a digital database resource (500) containing digital map information The digital map information includes a plurality of attractions; a processing resource (21 0) configured to: (a) receive (508) definitions from a user - a starting location for the path and for the path Entering at least one selection criterion; (b) performing a path calculation (590, 620) of the path based on the at least-selection criterion such that the path extends from the starting position of the ,#, past one of the attractions Or more, and return to the starting position. - a method for using information contained in a digital database containing digital map information from a departure location to a destination location 141719.doc • 4· 201104224 Method of calculation of the dynamic path, the digital map information Included in each of a plurality of attractions that represent light attractiveness' and the path passes through one or more of the attractions, the method includes the following steps: ^ - (4) determining (55Q) - initial from the departure location to the destination location Path, and set the initial path to - current path; ° (8) for each of the attractions in one of the attractions (6〇2) - depending on the distance between the attraction and the current path ^ (4) determining (604, 612) which-attraction corresponds to the _maximum y-force value; (4) modifying (620) the current path to include a deviation from the attraction determined at step (4). 2 1 · A method such as 5 Qing, 2, and .. It further includes a repeating step (}3) to (iteratively modifying the current path. 22. The method of claim 20) wherein step (4) is included The virtual location of the route location is zero (57) if the destination location is the same. 23. A computer program that, when executed by a processing resource, causes the processing resource to be implemented - for use in - a method for automated calculation of information contained in a digital database resource (500) containing digital map information from a departure location to a destination location, the digital map information comprising a plurality of attractions each representing a sightseeing attraction And the path passes through one or more of the attractions A, the method comprising the steps of: (4) determining (550) an initial path from the departure location to the destination location, and setting the initial path to a current path ; 141719.doc •5· 201104224 (b) For each of the attractions in the collection of attractions, indeed ~ (602) depends on the distance between the attraction and the current path (c) determining (604, 6 Π) which attraction corresponds to a maximum attraction value; (d) modifying (62〇) the current path to include the pair determined at step (c) A deviation of the attraction. 24. A machine-readable information carrier, a brain program. "The 141719.doc is planted or embodied as in claim 23.