SYSTEM AND METHOD FOR AUTOMATIC ADVANCEMENT OF NAVIGATION THROUGH A USER INTERFACE

• US 20180113948A1
• Filed: 10/26/2017
• Published: 04/26/2018
• Est. Priority Date: 10/26/2016
• Status: Active Grant

• Current Assignee: Advanced Digital Broadcast SA (Advanced Digital Broadcast Holdings SA)
• Original Assignee: Advanced Digital Broadcast SA (Advanced Digital Broadcast Holdings SA)
• Inventors: DABROWSKI, Bartosz
• Granted Patent: US 10,642,915 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 16/954 Navigation, e.g. using categorised browsing
• CPC Class Codes: G06F 3/048 Interaction techniques based on graphical user interfaces [GUI]
• CPC Class Codes: G06F 3/0485 Scrolling or panning
• CPC Class Codes: G06F 9/451 Execution arrangements for user interfaces
• CPC Class Codes: H04L 41/22 comprising specially adapted graphical user interfaces [GUI]
• CPC Class Codes: H04W 56/0045 compensating for timing error by altering transmission time

Abstract

A method for automatic advancement of navigation through GUI, involving: (a) providing a graph representing GUI, comprising at least two states and at least one path allowing navigation from one of said states to a different one of said states; (b) clearing a current path; (c) receiving a request to navigate to a state of said states and outputting a suitable response; (d) adding the current state to the current path; (e) starting a timer; (f) receiving a request to navigate to another state of said states and outputting a suitable response; (g) stopping said timer and comparing its result with a threshold value wherein if said result is lower than said threshold, adding information on said another state to the current path; (h) storing the current path in a paths database; and (i) repeating steps (e)-(h) until said result is greater than said threshold.

Claims

1. A method for automatic advancement of navigation through a user interface, the method being characterized in that it comprises the steps of:

a) providing a graph (200) being a representation of the user interface, comprising at least two states and at least one path allowing navigation from one of said states to a different one of said states;

b) clearing a current path (301);

c) receiving a request to navigate to a state of said states and outputting a suitable response (302);

d) adding (303) the current state to the current path;

e) starting a timer (304);

f) receiving a request to navigate to another state of said states and outputting a suitable response (305);

g) stopping said timer (306) and comparing its result (307) with a threshold value (308) wherein if said result is lower than said threshold, adding (309) information on said another state to the current path;

h) storing (311) the current path in a paths database (106);

i) repeating steps (e)-(h) until said result is greater than said threshold.

2. The method for automatic advancement of navigation through a user interface according to claim 1, the method being characterized in that prior to storing the current path there is executed a step of checking (310) whether the modified path is longer than a certain path length threshold.

3. The method for automatic advancement of navigation through a user interface according to claim 1, the method being characterized in that it further comprises the steps of:

navigating to a state of the at least two states;

retrieving (402) all paths for said state from the paths database (106);

extracting all said paths'"'"' endings (403);

presenting to a user (404) direct links to states represented by said endings.

4. The method for automatic advancement of navigation through a user interface according to claim 1, the method being characterized in that each path has an importance level assigned reflecting the suitability of the path for presentation to the user.

5. The method for automatic advancement of navigation through a user interface according to claim 1, the method being characterized in that the current path comprises a sequence of sub-nodes each containing an unambiguous reference to one state of the graph (200).

6. A non-transitory computer readable medium storing computer-executable instructions performing all the steps of the computer-implemented method according to claim 1 when executed on a computer.