Browse Prior Art Database

System and method for collaboration improvement on the way to work Disclosure Number: IPCOM000248543D
Publication Date: 2016-Dec-15
Document File: 3 page(s) / 74K

Publishing Venue

The Prior Art Database


Proposed is a method to find in real-time the most relevant nearby colleague available on the road to share the way to work optimizing the time spent together from working and/or personal perspective

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 52% of the total text.


System and method for collaboration improvement on the way to work

Everyday million of people need to get to the office by car , by the public transport or by foot. Disclosed here is a method to find in real -time the most relevant nearby colleague available on the road to share the way to the work together . The target is not only to identify the closest one but the closest one sharing interests or collaborative tasks so to make as much as possible advantageous or amazing the time spent together. On the other side the same approach can be used when scheduling working tasks. A user who needs a lift to the office is supposed to look for available drivers in real time through an app on his own device (most probably provided from the employer), the system will initially show to the user all the available drivers and to the drivers only the passengers on his usual route but a filtering criteria can be applied to the proposed nearby colleagues to which a lift can be asked . Possible filtering criteria can be they are working on the same project , they share a tasks to complete in a short time, they have ongoing separate activities and skills matching , they share calendar entries, they have technical profiles which can potentially trigger innovation and so on. These are all criteria targeted to progress from work place point of view but the criteria can be of whatever type even oriented to have better time together or to share and improve common interests extending the application of this to whatever people community. On the other side, this kind of optimization can be done also when scheduling meeting, with the idea to optimize the time spent on the route to work. Criteria list is dynamically defined and pushed from back -end systems to the user. Available filtering criteria could be (but also 'all' applies):

- working on the same project - belonging to a same community - sharing calendar entries for the day - working at dependent tasks - matching skills for ongoing activities - high innovation potential - common technical interests - key skills for solving assigned customer issue

but also less work-oriented and more user-defined such as - favorite colleague list based on previous rides feedback - common interests and hobbies - feedback provided by other colleagues (reputation) or accumulated score

Some of these criteria are established at run-time based on recent working activity and therefore absolutely dynamic. Users matching the criteria are displayed on the map and the hitchhiker can select the identified driver sending him a request message from the app. The driver can choose to answer with an acknowledge and the system proposes a meeting point on the map to the hitchhiker or the driver can dismiss the request. Every ride accepted increases the driver’s score. High score drivers can be in some way even rewarded.


The figure here is an example of wh...