WO2011072079A1 - Method and apparatus for accounting for user experience in pedestrian navigation routing - Google Patents

Method and apparatus for accounting for user experience in pedestrian navigation routing Download PDF

Info

Publication number
WO2011072079A1
WO2011072079A1 PCT/US2010/059574 US2010059574W WO2011072079A1 WO 2011072079 A1 WO2011072079 A1 WO 2011072079A1 US 2010059574 W US2010059574 W US 2010059574W WO 2011072079 A1 WO2011072079 A1 WO 2011072079A1
Authority
WO
WIPO (PCT)
Prior art keywords
interest
point
destinations
points
optimal path
Prior art date
Application number
PCT/US2010/059574
Other languages
English (en)
French (fr)
Inventor
Rajarshi Gupta
Saumitra Mohan Das
Min-Wook Jeong
Original Assignee
Qualcomm Incorporated
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Qualcomm Incorporated filed Critical Qualcomm Incorporated
Priority to CN201080056328.5A priority Critical patent/CN102656426B/zh
Priority to EP10798213.4A priority patent/EP2510311B1/en
Priority to KR1020127017959A priority patent/KR101399143B1/ko
Priority to JP2012543266A priority patent/JP5907888B2/ja
Publication of WO2011072079A1 publication Critical patent/WO2011072079A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/02Services making use of location information
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/20Instruments for performing navigational calculations
    • G01C21/206Instruments for performing navigational calculations specially adapted for indoor navigation
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3453Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3476Special cost functions, i.e. other than distance or default speed limit of road segments using point of interest [POI] information, e.g. a route passing visible POIs
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/38Electronic maps specially adapted for navigation; Updating thereof
    • G01C21/3885Transmission of map data to client devices; Reception of map data by client devices
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W88/00Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/02Terminal devices

Definitions

  • FIG. 1 is a view of two paths to a destination according to one or more implementations
  • navigation instructions may be presented on a display screen of a mobile device, for example. In some implementations, navigation instructions may be audibly presented to a user via a speaker and/or headphones, for example.
  • Navigation instructions to guide a user from a starting location to a destination may include several segments or branches, for example. For example, a navigation instruction to "walk straight for 50 feet" may comprise a first branch and "turn left and walk straight for 60 feet" may comprise a second branch. In an indoor environment, there may be numerous branches along a particular path from a starting location to an end location or destination.
  • pedestrian navigation environment may refer to a pedestrian- accessible environment or area.
  • pedestrian navigation environments include indoor environments and outdoor environments.
  • indoor pedestrian environments include enclosed structures such as office buildings, hotels, shopping malls, convention centers, and sports stadiums, to name just a few among many possible examples.
  • outdoor pedestrian environments include amusement parks, zoos, outdoor shopping strips or malls, parks, and areas having pedestrian-accessible walkways, such as sidewalks, to name just a few among many possible examples.
  • a path may be associated with a distance cost based at least in part on a physical distance between a starting location and one or more destinations.
  • a distance cost for the path may be summed with costs for points of interest and/or segments located along the path.
  • a distance cost for a path may be represented with a positive value or number.
  • a point of interest may be represented with a value or number that is positive or negative.
  • a positive value of a cost for a point of interest may indicate that the point of interest adds to an overall cost for a path.
  • a negative value of a cost for a point of interest may indicate that the point of interest adds value and therefore reduces an overall cost for the path. 093426
  • a point of interest and a destination include the category "crowded," and a point of interest properties vector has a value of 0.4 and a destination properties vector has a value of 0.6, the product of these values would be 0.24. Similar products may be determined by multiplying values for other common categories. For example, if only one of the properties vectors being multiplied includes a particular category, then the product for such a category is 0. After products across all categories have been computed, the products may be summed to determine a value. In one or more implementations, a relatively large value may indicate a high level or similarity between a point of interest and a destination.
  • FIG. 2 illustrates a view of a shopping mall 100 according to one or more implementations.
  • Shopping mall 100 may include several stores/places of business 093426
  • second path 165 routes a user past several restaurants or food shops, such as cookie shop 125, third restaurant 120, second restaurant 115, and coffee shop 110 on the way to point B 160 located near first restaurant 105.
  • second path 165 may be a more desirable path than first path 170 because second path 165 directs a user past numerous points of interest that have some similarities with a destination, which in this case is first restaurant 105.
  • restaurant 120 may sell food items and/or beverages that may be consumed and may therefore be of interest to a user.
  • a point of interest node may be located off of a corridor.
  • a point of interest may be located adjacent to or accessible by a corridor, instead of actually being located within the corridor itself. Accordingly, in order to account for a cost associated with a point of interest node, a cost for the point of interest node may be projected onto or applied to one or more corridor nodes, as discussed below.
  • first point of interest 202 may include first point of interest node 218, second point of interest 204 may include second point of interest node 220, third point of interest 206 may include third point of interest node 222, fourth point of interest 208 may include fourth point of interest node 224, fifth point of interest 210 may include fifth point of interest node 226, sixth point of interest 212 may include sixth point of interest node 228, seventh point of interest 214 may include seventh point of interest node 230, and eighth point of interest 216 may include eighth point of interest node 232.
  • Electronic map 200 illustrates two corridors - a first corridor 252 and a second corridor 254.
  • Several corridor nodes 234 may be dispersed throughout first corridor 252 and second corridor 254.
  • Corridor nodes are represented in electronic map 200 with "x" characters.
  • a segment may be located between corridor nodes.
  • segment 256 is located between corridor nodes 234 and 236.
  • Corridor nodes 234 and segments 256 may each be associated with a cost. Such costs may be considered by a navigation system determining a lowest cost path from a starting location to a destination.
  • a cost associated with a point of interest node may be projected onto a nearby corridor node.
  • fourth point of interest 208 and eighth point of interest 216 border both first corridor 252 and second corridor 254.
  • a cost for a point of interest node may be projected onto corridor nodes located in more than one corridor if a point of interest associated with the point of interest node contains multiple entryways or doors.
  • fourth point of interest 208 may include a first entryway 260 that provides access to first corridor 252 and a second entryway 262 that provides access to second corridor 254.
  • a cost for fourth point of interest node 224 may be projected onto corridor node 246 located within first corridor 252 and corridor node 248 located within second corridor 254.
  • a cost for eighth point of interest node 232 may be projected onto corridor node 246 located within first corridor 252 and corridor node 250 located within second corridor 254.
  • a lowest cost path may be determined to guide a user from a starting location to a destination. Such a lowest cost path may extend through one or more corridors and across multiple corridor nodes and segments. It should be appreciated that costs associated with points of interest may have an impact on a lowest cost path because such costs are projected onto one or more corridor nodes.
  • FIGS. 4A-C illustrate views of a portion of an electronic map in which a cost associated with a point of interest node is projected onto one or more corridor nodes.
  • FIG. 4A illustrates a point of interest 305 associated with a point of interest node 310.
  • a corridor 315 is located along one side of point of interest 305.
  • Corridor nodes 320, 325, 330, 335, and 340 may be located within corridor 315.
  • a cost for point of interest node 310 onto one corridor node located along corridor 315 as was performed with respect to FIG. 3 as 093426
  • the cost may instead be projected onto multiple corridor nodes based at least in part on proximity between such corridor nodes and point of interest 305.
  • FIG. 4B illustrates an ellipse 350 drawn around point of interest 305.
  • ellipse 350 may completely surround point of interest 305.
  • foci of ellipse 350 may be selected to generate the smallest possible ellipse 350 capable of completely surrounding point of interest 305.
  • Ellipse 350 may be increased by a predefined amount or percentage to generate a larger ellipse capable of overlapping with one or more corridor nodes.
  • a cost associated with such a point of interest may be projected onto multiple corridor nodes to effectively multiply a cost of a point of interest based at least in part on its dimensions/physical size. If a point of interest is so similar with a destination that it is associated with a negative cost, for example, an ellipse method as discussed above may project a negative cost for point of interest onto multiple corridor nodes to effectively guide a user past such a point of interest along a lowest cost path.
  • a cost for a particular point of interest may be based at least in part on a measurement of similarity between the point of interest and a destination, for example.
  • Points of interest may be associated with one or more point of interest properties vectors, as discussed above.
  • a destination may be associated with a destination properties vector.
  • Each properties vector may include one or more categories and associated values for each category to categorize a point of interest or destination.
  • a measurement of similarity between a point of interest and a destination may be determined based at least in part on computation of a dot product between a point of interest properties vector and a destination properties vector.
  • a properties vector for a point of interest may contain similar weightings for the same categories as a destination properties vector for a similar destination.
  • a dot product determined between such a destination properties vector and a point of interest properties vector may be associated with a higher value than would a dot product determined between a destination properties vector and a point of interest properties vector for a point of interest that is unrelated to a destination. Accordingly, a value of a dot product between a destination properties vector and a point of interest properties vector may indicate an estimate of similarity between an associated destination and an associated point of interest. 093426
  • Table A shown below illustrates a destination properties vector for a restaurant.
  • a properties vector is associated with one or more points of interest.
  • a properties vector associated with the destination is referred to as a destination properties vector.
  • a properties vector for the point of interest is instead referred to as a point of interest properties vector.
  • the same properties vector and associated categories and values may be associated with a particular location regardless of whether that particular location comprises a point of interest or a destination.
  • Table A illustrates several categories and associated values for a restaurant.
  • categories include “nourishment,” “crowdedness,” “child- friendly,” “noise level,” and “vegan food.”
  • a value for "nourishment” is listed at 1.00.
  • category “nourishment” may be associated with a high value, which in this case is 1.00.
  • “Crowdedness” is listed as having a value of -0.60. If, for example, a restaurant is typically so packed with people that the crowdedness detracts from an overall user experience, a negative value may be associated with a "crowdedness" category.
  • a third category in this example is "child-friendly," which is associated with a value of 0.75. If, for example, a restaurant has a children's menu and/or placements that children can color with crayons, a relatively high value may be associated with “child-friendly.” "Noise level” is associated with a value of -0.50. If, for example, a restaurant is very loud, a category for "noise level” may be associated with a negative value. Finally, category “vegan food” may be associated with a value of 0.80. If a restaurant offers several vegetarian entrees, category “vegan food” may be associated with a relatively high value, such as 0.80 in this example. It should be appreciated that although only 093426
  • Table B illustrates a point of interest properties vector for a bar that comprises a point of interest. As shown, Table B includes various categories such as “nourishment,” “crowdedness,” “child-friendly,” “noise level,” and “alcohol selection.” “Nourishment” is associated with a value of 0.60 to indicate that a source of
  • a bar may offer peanuts, refreshments, and/or simple meals such as hamburgers, although a selection of food is not as large as would be available at a full scale restaurant.
  • “Crowdedness” may be associated with a value of -0.80 to indicate that the bar is crowded to the extent that it detracts from an overall user experience.
  • “Child-friendly” may be associated with a value of -1.0 to indicate, for example, that children are banned from the establishment.
  • "Noise level” may also be associated with a value of -1.0 to indicate, for example, that the bar is very loud to the extent that it greatly detracts from a user experience of a typical person.
  • “alcohol selection” may be associated with a value of 1.00, for example, to specify that a wide variety of alcohol is available to the establishment and that such a selection adds to an overall user experience. 093426
  • Table C illustrates a point of interest properties vector for a book store that comprises a point of interest.
  • Table C includes various categories such as “nourishment,” “crowdedness,” “child-friendly,” “noise level,” and “DVD selection.”
  • “Nourishment” is associated with a value of 0.10 to indicate that such a book store offers little nourishment. For example, the book store might sell bottles of soda or candy bars, but no other food.
  • “Crowdedness” is associated with a value of 0.30 to indicate, for example, that the bookstore is not very crowded.
  • “Child-friendly” may be associated with a value of 0.75 to indicate that the book store offers products or an experience that children may enjoy.
  • the book store may sell children's book and/or toys.
  • Noise level may, for example, be associated with a value of 0.75 to indicate that the noise level is very low within the bookstore.
  • DVD selection may be associated with a value of 0.60 to indicate that a reasonable assortment of Digital Versatile Discs (DVDs) are available for sale at such a bookstore.
  • a dot product may be calculated 093426
  • Table D illustrates values for categories determined by calculating a dot product between a destination represented by Table A and a point of interest represented by Table B. If a dot product is computed, values for categories that are common to both Table A and B are multiplied together and then summed. In this case, the only common categories are "nourishment,” “crowdedness,” “child-friendly,” and “noise level.” Table A contains a category "vegan food” and is not common to Table B, so is not multiplied against any other values from Table B, for example.
  • a product of these values is therefore 0.60 (e.g., 1.00 * 0.60).
  • Products for "crowdedness,” “child-friendly,” and “noise level” may similarly be calculated as 0.48, -0.75, and 0.50, respectively.
  • a sum of such products is 0.83 (e.g., 0.60 + 0.48 + -0.75 + 0.50).
  • a value of 0.83 may indicate that a measurement of similarity between a destination and a point of interest represented by Tables A and B, respectively, is relatively high. Accordingly, a relatively low cost may be associated with a point of interest represented by Table B.
  • a negative cost may be associated with a point of interest represented by Table B as a result of its relatively high measurement of similarity.
  • a lookup table may be referenced to determine a cost associated with a dot product of 0.83. 093426
  • a dot product may also be calculated based at least in part on a comparison of Tables A and C to determine whether a point of interest associated with Table C is relatively similar to a destination associated with Table A.
  • a destination properties vector associated with the destination may be compared with point of interest properties vectors for various points of interest within a certain range or vicinity of the destination. For example, dot products and associated costs may be calculated based on such a comparison. Use of such properties vectors may provide a uniform process for comparing different points of interest with destinations. Such comparisons may be calculated on-the-fly by a navigation application, for example, to determine costs for such points of interest. If costs for such points of interest are known or otherwise calculated, a lowest cost path may be determined between a starting location and a destination.
  • a user may select a group of destinations, as opposed to a single destination. For example, if a user is hungry but does not know the name of a particular fast food place within a mall, user may be directed to an area encompassing multiple fast food places. In one or more
  • point of interest properties vectors for two or more different points of interest may be combined to determine a composite point of interest properties vector. If, for example, a food court contains both a hamburger stand and a sandwich shop, a composite point of interest properties may be determined that accounts for
  • values of categories for a hamburger stand and a sandwich shop may be averaged together to determine values for categories in a composite point of interest properties vector. For example, if point of interest properties vector for a hamburger stand has a value of "0.85" for "nourishment,” and a sandwich shop has a value of "0.55" for the same category, a value for "nourishment” in a composite point of interest properties vector may be "0.70,” e.g., an average of values "0.85" and "0.55.” In some implementations, on the other hand, values for a particular category may be added together instead of averaged.
  • FIG. 5 is a flow diagram 500 of a process for determining a low cost path from a starting location to a destination according to one or more implementations.
  • a cost may be determined for one or more points of interest based at least in part on a comparison between a point of interest and a destination.
  • a user may provide an intended destination via a user input.
  • relative costs for one or more points of interest may be determined.
  • a dot product may be utilized to determined respective values of points of interest based on a comparison with a destination.
  • Associated costs may be determined based at least in part on such a measurement of similarity between points of interest and a destination.
  • Costs for point of interest nodes may be projected onto corridor nodes and may be utilized to determine a lowest cost path from a starting location to a destination at operation 510. For example, a lowest cost path from a starting location to a destination may be determined based at least in part on costs associated with one or more points of interest along the path.
  • a lowest cost path may be presented to a user. For example, navigation instructions may be displayed or audibly presented to a user.
  • FIG. 6 is a schematic block diagram of a particular implementation of a mobile device 600 according to one implementation.
  • Mobile device 600 may include several elements such as processing unit 605, user interface 610, transmitter 615, receiver 620, and memory 625.
  • Mobile device 600 may determine a lowest cost path from a starting location to a destination.
  • a map may be transmitted from a map server to mobile device 600 via a network, such as the Internet, for example.
  • a map may be pre-stored in a memory 625. Names and locations of various points of interest may be associated with a map and stored with associated properties vectors in memory 625.
  • a processing unit 605 may compute dot products between a destination properties vector and various point of interest properties vectors and may determine associated costs for such points of interest. In some implementations, such dot products and associated costs for points of interest may be determined remotely at a map server, for example, and may be transmitted to mobile device 600. 26
  • Mobile device 600 may comprise a mobile station (MS) in which a radio transmitter may be adapted to modulate an RF carrier signal with baseband information, such as voice or data, onto an RF carrier, and a radio receiver may demodulate a modulated RF carrier to obtain such baseband information.
  • MS mobile station
  • baseband information such as voice or data
  • User interface 610 may comprise a plurality of devices for inputting or outputting user information such as voice or data. Such devices may include, for example, a keyboard, a display screen, a microphone, a speaker, buttons and knobs, just to name a few examples. User interface 610 may present a map to a user.
  • Memory 625 may be adapted to store machine -readable instructions, which are executable to perform one or more of processes, examples, or implementations thereof which have been described or suggested.
  • Processing unit 605 may be adapted to access and execute such machine-readable instructions. Through execution of these machine -readable instructions, processing unit 605 may direct various elements of mobile device 600 to perform one or more functions.
  • Transmitter 615 may utilize an antenna to transmit communications, such as packet-based communications to other wireless devices.
  • Receiver 620 may also utilize such an antenna to receive communications, such as packet-based
  • a mobile device may estimate its own location by communicating with one or more nearby femtocells in some implementations.
  • a femtocell may, for example, utilize a technology such as Universal Mobile
  • UTMS Telecommunications System
  • LTE Long Term Evolution
  • EV-DO Evolution-Data only
  • GSM Global System for Mobile communications
  • WiMAX Worldwide Interoperability for Microwave Access
  • CDMA Code division multiple access
  • TD-SCDMA Time Division Multiple Access
  • a femtocell may also have integrated Wi-Fi, in which case round-trip time ranging may be performed utilizing the femtocell.
  • a special purpose computer or a similar special purpose electronic computing device is capable of manipulating or transforming signals, typically represented as physical electronic or magnetic quantities within memories, registers, or other information storage devices, transmission devices, or display devices of the special purpose computer or similar special purpose electronic computing device.
  • a specific computing apparatus may comprise one or more processing units
  • a WW AN may be a Code Division Multiple Access (CDMA) network, a Time Division Multiple Access (TDMA) network, a Frequency Division Multiple Access (FDMA) network, an Orthogonal Frequency Division Multiple Access (OFDMA) network, a Single-Carrier Frequency Division Multiple Access (SC-FDMA) network, a Long Term Evolution (LTE) network, a WiMAX (IEEE 802.16) network and so on.
  • CDMA Code Division Multiple Access
  • TDMA Time Division Multiple Access
  • FDMA Frequency Division Multiple Access
  • OFDMA Orthogonal Frequency Division Multiple Access
  • SC-FDMA Single-Carrier Frequency Division Multiple Access
  • LTE Long Term Evolution
  • WiMAX IEEE 802.16
  • a CDMA network may implement one or more radio access technologies (RATs) such as cdma2000, Wideband-CDMA (W-CDMA), and so on.
  • Cdma2000 includes IS-95, IS- 2000, and IS-856 standards.
  • a TDMA network may implement Global System for Mobile Communications (GSM), Digital Advanced Mobile Phone System (D-AMPS), or some other RAT.
  • GSM and W-CDMA are described in documents from a consortium named "3rd Generation Partnership Project” (3GPP).
  • Cdma2000 is described in documents from a consortium named "3rd Generation Partnership Project 2" (3GPP2).
  • 3GPP and 3GPP2 documents are publicly available.
  • a WLAN may be an IEEE 093426
  • a WPAN may be a Bluetooth network, an IEEE 802.15x, or some other type of network.
  • the techniques may also be implemented in conjunction with any combination of WW AN, WLAN and/or WPAN.
  • a mobile station refers to a device such as a cellular or other wireless communication device, personal communication system (PCS) device, personal navigation device (PND), Personal Information Manager (PIM), Personal Digital Assistant (PDA), laptop, tablet or other suitable device which is capable of receiving wireless communication and/or navigation signals.
  • the term "mobile station” is also intended to include devices which communicate with a personal navigation device (PND), such as by short-range wireless, infrared, wireline connection, or other connection - regardless of whether satellite signal reception, assistance data reception, and/or position-related processing occurs at the device or at the PND.
  • PND personal navigation device
  • mobile station is intended to include all devices, including wireless communication devices, computers, laptops, etc.
  • a server which are capable of communication with a server, such as via the Internet, Wi-Fi, or other network, and regardless of whether satellite signal reception, assistance data reception, and/or position-related processing occurs at the device, at a server, or at another device associated with the network. Any operable combination of the above are also considered a "mobile station.”
  • the methodologies described herein may be implemented by various means depending upon the application. For example, these methodologies may be implemented in hardware, firmware, software, or any combination thereof.
  • the processing units may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro- 093426
  • ASICs application specific integrated circuits
  • DSPs digital signal processors
  • DSPDs digital signal processing devices
  • PLDs programmable logic devices
  • FPGAs field programmable gate arrays
  • processors controllers, micro- 093426
  • controllers microprocessors, electronic devices, other electronic units designed to perform the functions described herein, or a combination thereof.
  • the methodologies may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein.
  • Any machine-readable medium tangibly embodying instructions may be used in implementing the methodologies described herein.
  • software codes may be stored in a memory and executed by a processing unit.
  • Memory may be implemented within the processing unit or external to the processing unit.
  • memory refers to any type of long term, short term, volatile, nonvolatile, or other memory and is not to be limited to any particular type of memory or number of memories, or type of media upon which memory is stored.
  • the functions may be stored as one or more instructions or code on a computer-readable medium. Examples include computer-readable media encoded with a data structure and computer-readable media encoded with a computer program. Computer-readable medium may take the form of an article of manufacture. Computer-readable media include physical computer storage media. A storage medium may be any available medium that can be accessed by a computer.
  • such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, semiconductor storage, or other storage devices, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer; disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data 093426
  • instructions and/or data may be provided as signals on transmission media included in a communication apparatus.
  • a communication apparatus may include a transceiver having signals indicative of instructions and data.
  • the instructions and data are configured to cause one or more processing units to implement the functions outlined in the claims. That is, the communication apparatus includes transmission media with signals indicative of information to perform disclosed functions.
  • transmission media included in the communication apparatus may include a first portion of the information to perform the disclosed functions, while at a second time the transmission media included in the communication apparatus may include a second portion of the information to perform the disclosed functions.
  • Instructions relate to expressions which represent one or more logical operations.
  • instructions may be "machine-readable” by being interpretable by a machine for executing one or more operations on one or more data objects.
  • instructions as referred to herein may relate to encoded commands which are executable by a processing unit having a command set which includes the encoded commands.
  • Such an instruction may be encoded in the form of a machine language understood by the processing unit.

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)
  • Mobile Radio Communication Systems (AREA)
PCT/US2010/059574 2009-12-11 2010-12-08 Method and apparatus for accounting for user experience in pedestrian navigation routing WO2011072079A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
CN201080056328.5A CN102656426B (zh) 2009-12-11 2010-12-08 用于在行人导航路由中计及用户体验的方法和装置
EP10798213.4A EP2510311B1 (en) 2009-12-11 2010-12-08 Method and apparatus for accounting for user experience in pedestrian navigation routing
KR1020127017959A KR101399143B1 (ko) 2009-12-11 2010-12-08 보행자 네비게이션 라우팅시에 사용자 경험을 고려하는 방법 및 장치
JP2012543266A JP5907888B2 (ja) 2009-12-11 2010-12-08 歩行者ナビゲーションルート指示においてユーザエクスペリエンスを考慮するための方法および装置

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US28585209P 2009-12-11 2009-12-11
US61/285,852 2009-12-11
US12/846,672 2010-07-29
US12/846,672 US8392113B2 (en) 2009-12-11 2010-07-29 Method and apparatus for accounting for user experience in pedestrian navigation routing

Publications (1)

Publication Number Publication Date
WO2011072079A1 true WO2011072079A1 (en) 2011-06-16

Family

ID=44143862

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2010/059574 WO2011072079A1 (en) 2009-12-11 2010-12-08 Method and apparatus for accounting for user experience in pedestrian navigation routing

Country Status (7)

Country Link
US (1) US8392113B2 (ja)
EP (1) EP2510311B1 (ja)
JP (2) JP5907888B2 (ja)
KR (1) KR101399143B1 (ja)
CN (1) CN102656426B (ja)
TW (1) TWI436034B (ja)
WO (1) WO2011072079A1 (ja)

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2452325B1 (en) 2009-07-09 2014-04-23 TomTom International B.V. Navigation device and method for time-dependent route calculation
JP6030544B2 (ja) * 2010-04-23 2016-11-24 トムトム インターナショナル ベスローテン フエンノートシャップ コンピュータデバイス、その方法、記憶媒体、及びナビゲーション装置
US9547369B1 (en) 2011-06-19 2017-01-17 Mr. Buzz, Inc. Dynamic sorting and inference using gesture based machine learning
US9122757B1 (en) * 2011-06-19 2015-09-01 Mr. Buzz, Inc. Personal concierge plan and itinerary generator
US8621394B2 (en) 2011-08-26 2013-12-31 Nokia Corporation Method, apparatus and computer program product for displaying items on multiple floors in multi-level maps
US20140032250A1 (en) * 2012-07-27 2014-01-30 Ebay, Inc. Interactive Venue Seat Map
US9945676B2 (en) * 2013-03-05 2018-04-17 Telenav, Inc. Navigation system with content curation mechanism and method of operation thereof
US9115997B2 (en) * 2013-06-11 2015-08-25 Qualcomm Incorporated Modeling characteristics of a venue
US20150026006A1 (en) 2013-07-17 2015-01-22 Google Inc. Point-of-interest latency prediction using mobile device location history
US8949028B1 (en) 2013-12-02 2015-02-03 Ford Global Technologies, Llc Multi-modal route planning
CN105333882B (zh) * 2014-08-07 2019-03-15 北京四维图新科技股份有限公司 一种建筑中的路径引导规划方法、装置及终端
US9599484B2 (en) * 2014-11-10 2017-03-21 International Business Machines Corporation Social media based weighted route selection
JP5793234B1 (ja) * 2014-12-05 2015-10-14 真人 田村 交通事故防止システム
JP5937246B1 (ja) * 2015-03-01 2016-06-22 真人 田村 交通安全システム
US9996574B2 (en) 2015-06-30 2018-06-12 International Business Machines Corporation Enhancements for optimizing query executions
US10692023B2 (en) * 2017-05-12 2020-06-23 International Business Machines Corporation Personal travel assistance system and method for traveling through a transport hub
JP7146225B2 (ja) * 2017-06-01 2022-10-04 株式会社ナビタイムジャパン 情報処理システム、情報処理プログラム、情報処理装置及び情報処理方法
US10249116B1 (en) * 2018-03-12 2019-04-02 Mapsted Corp. Method and system for mobile device localization-based access
US11035681B2 (en) * 2018-07-20 2021-06-15 Verizon Patent And Licensing Inc. Preserving original route information after recalculation of a route
US11421993B2 (en) * 2018-10-10 2022-08-23 University Of Massachusetts Human vision-empowered 3D scene analysis tools
WO2020166745A1 (ko) * 2019-02-15 2020-08-20 엘지전자 주식회사 차량용 전자 장치, 차량용 전자 장치의 동작 방법 및 시스템
CN110375743A (zh) * 2019-07-25 2019-10-25 中国工商银行股份有限公司 导航设备、导航方法和电子设备
TWI733481B (zh) * 2020-06-03 2021-07-11 南開科技大學 多目地路徑規劃系統及其方法

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1241651A1 (en) * 2001-03-12 2002-09-18 Magellan Dis Inc. Off-board navigation system with personalized navigation database
JP2007078367A (ja) * 2005-09-09 2007-03-29 Navitime Japan Co Ltd ナビゲーションシステム、情報配信サーバおよび携帯端末ならびにナビゲーションシステムにおけるマーケティングデータ作成方法

Family Cites Families (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5470233A (en) * 1994-03-17 1995-11-28 Arkenstone, Inc. System and method for tracking a pedestrian
US6041311A (en) 1995-06-30 2000-03-21 Microsoft Corporation Method and apparatus for item recommendation using automated collaborative filtering
JP2001033266A (ja) * 1999-07-26 2001-02-09 Toyota Motor Corp 車両用経路案内装置及び方法並びに媒体
US7050904B2 (en) * 2000-02-22 2006-05-23 Pointserve, Inc. Data formats and usage for massive point-to-point route calculation
JP2002169914A (ja) * 2000-11-30 2002-06-14 Toyota Motor Corp 経路案内装置及び方法
JP2002183878A (ja) * 2000-12-15 2002-06-28 Toshiba Corp 歩行者用道案内システム、歩行者用道案内サービス方法、道案内データ収集装置および道案内データ収集方法
JP2003185453A (ja) * 2001-12-20 2003-07-03 Mitsubishi Electric Corp ナビゲーション装置および経路探索方法
JP4043846B2 (ja) * 2002-05-29 2008-02-06 アルパイン株式会社 ナビゲーション装置
JP2004197653A (ja) 2002-12-18 2004-07-15 Toyota Motor Corp 車両制御装置
US6845321B1 (en) * 2003-06-30 2005-01-18 Michael Lester Kerns Method and system for providing narrative information to a traveler
JP2005069733A (ja) * 2003-08-20 2005-03-17 Denso Corp ナビゲーション装置、再探索プログラム、及び記憶媒体
JP2005134148A (ja) * 2003-10-28 2005-05-26 Denso Corp 地図表示装置
JP2005196476A (ja) 2004-01-07 2005-07-21 Yamaha Corp パラメータ設定装置
JP2005308543A (ja) * 2004-04-21 2005-11-04 Denso Corp 地図表示機能を有する電子機器及びプログラム
JP4497528B2 (ja) * 2004-06-04 2010-07-07 株式会社ケンウッド カーナビゲーション装置、カーナビゲーション方法及びプログラム
JP4400347B2 (ja) * 2004-07-08 2010-01-20 株式会社デンソー ナビゲーション装置およびプログラム
JP2006276963A (ja) * 2005-03-28 2006-10-12 Aisin Aw Co Ltd 地点検索システム
JP4735057B2 (ja) * 2005-05-31 2011-07-27 日産自動車株式会社 情報提供装置及び情報提供方法
US7356407B2 (en) * 2005-10-06 2008-04-08 Gm Global Technology Operations, Inc. Optimal route calculation based upon cohort analysis
KR20080105160A (ko) * 2006-03-15 2008-12-03 퀄컴 인코포레이티드 사용자의 루트에 기초하여 관련된 관심 지점 정보를 결정하는 방법 및 장치
JP2008020334A (ja) * 2006-07-13 2008-01-31 Denso It Laboratory Inc 車両用ナビゲーション装置、方法およびプログラム
US20080154720A1 (en) * 2006-12-20 2008-06-26 Microsoft Corporation Shopping route optimization and personalization
US20080281516A1 (en) * 2007-05-02 2008-11-13 Ian Cummings Advertising management in a wireless client-server navigation system
JP2008309599A (ja) * 2007-06-14 2008-12-25 Pioneer Electronic Corp 情報出力装置および情報出力方法
JP2009139129A (ja) * 2007-12-04 2009-06-25 Fujitsu Ten Ltd コンテンツ選択候補抽出装置、コンテンツ選択候補抽出方法、行動予測装置、行動予測方法、分類項目内容推定装置および分類項目内容推定方法
WO2009081499A1 (ja) * 2007-12-26 2009-07-02 Pioneer Corporation ナビゲーション装置、ナビゲーション方法、ナビゲーションプログラム、および記録媒体
CN101532842A (zh) * 2008-03-13 2009-09-16 联发科技(合肥)有限公司 确定从起点到终点的目标路线的路径规划方法及其装置
US20110320275A1 (en) * 2010-06-23 2011-12-29 International Business Machines Corporation Advertising proximity route selection

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1241651A1 (en) * 2001-03-12 2002-09-18 Magellan Dis Inc. Off-board navigation system with personalized navigation database
JP2007078367A (ja) * 2005-09-09 2007-03-29 Navitime Japan Co Ltd ナビゲーションシステム、情報配信サーバおよび携帯端末ならびにナビゲーションシステムにおけるマーケティングデータ作成方法

Also Published As

Publication number Publication date
CN102656426A (zh) 2012-09-05
KR20120103701A (ko) 2012-09-19
TW201139994A (en) 2011-11-16
KR101399143B1 (ko) 2014-05-27
JP2013520640A (ja) 2013-06-06
US20110144903A1 (en) 2011-06-16
JP5907888B2 (ja) 2016-04-26
TWI436034B (zh) 2014-05-01
EP2510311B1 (en) 2016-06-15
EP2510311A1 (en) 2012-10-17
US8392113B2 (en) 2013-03-05
JP6012673B2 (ja) 2016-10-25
CN102656426B (zh) 2016-05-11
JP2014206546A (ja) 2014-10-30

Similar Documents

Publication Publication Date Title
EP2510311B1 (en) Method and apparatus for accounting for user experience in pedestrian navigation routing
JP5973509B2 (ja) ロケーションコンテキスト識別子を用いた移動局ナビゲーションのためのスケーラブルルーティング
CN102762955B (zh) 位置知悉式推荐引擎
EP2510310B1 (en) Method and apparatus for reducing instructions in an indoor navigation environment
US9749780B2 (en) Method and apparatus for mobile location determination
KR20160098445A (ko) 품목들의 위치를 찾아서 품목 위치들을 결정하기 위한 방법들 및 시스템들
CN104884896A (zh) 用于位置确定的基于情境的参数映射
US20130345967A1 (en) Routability graph with predetermined number of weighted edges for estimating a trajectory of a mobile device
WO2014074351A1 (en) Portal transition parameters for use in mobile device positioning
US9445240B2 (en) Systems and methods for pedestrian indoor positioning
WO2012009330A1 (en) Methods and apparatuses for use in generating an encoded routeability graph description
KR102507279B1 (ko) 비콘 기반 실내 이동 경로 제공 방법 및 장치
Elhamshary et al. Towards ubiquitous indoor spatial awareness on a worldwide scale
Maneerat et al. An Enhanced Floor Estimation Algorithm for Indoor Wireless localization systems using confidence interval approach
Han et al. Building a disaster rescue platform with utilizing device-to-device communication between smart devices
US20220003568A1 (en) System and method of finding and engaging with historical markers

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201080056328.5

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10798213

Country of ref document: EP

Kind code of ref document: A1

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10798213

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
WWE Wipo information: entry into national phase

Ref document number: 1427/MUMNP/2012

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2012543266

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2010798213

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 20127017959

Country of ref document: KR

Kind code of ref document: A